Optimal Manufacturing Controller Synthesis Using Situation Calculus

Autor: Adalat, Omar, Scrimieri, Daniele, Konur, Savas

Yes
In this paper, we discuss a framework for synthesising manufacturing process controllers using situation calculus, a well-known second-order logic for reasoning about actions in AI. Using a library of high-level ConGolog programs and logical

Externí odkaz: http://hdl.handle.net/10454/19661

Actions, Continuous Distributions and Meta-Beliefs

Autor: Belle, Vaishak

Publikováno v: Belle, V 2023, Actions, Continuous Distributions and Meta-Beliefs . in Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems . Richland, SC, pp. 418–426, The 22nd International Conference on Autonomous Agents and Multiagent Systems, 2023, London, United Kingdom, 29/05/23 . https://doi.org/10.5555/3545946.3598665

In this work, we propose a new modal logical language for reasoning about noisy actions and sensors in an epistemic setting. In the reasoning about actions literature, there are only a few frameworks for modelling probabilistic noise, and even less i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3094::af7acc8477cf2ac684610d3d41861326
https://hdl.handle.net/20.500.11820/af46c368-9f68-4a46-aac2-1ce39fe59c55

On the Complexity of Verifying Timed Golog Programs over Description Logic Actions: Extended Version

Autor: Koopmann, Patrick, Zarrieß, Benjamin

Golog programs allow to model complex behaviour of agents by combining primitive actions defined in a Situation Calculus theory using imperative and non-deterministic programming language constructs. In general, verifying temporal properties of Golog

Externí odkaz: https://tud.qucosa.de/id/qucosa%3A79602
https://tud.qucosa.de/api/qucosa%3A79602/attachment/ATT-0/

Automatic Verification of Liveness Properties in the Situation Calculus

Autor: Yongmei Liu, Jian Li

Publikováno v: AAAI

In dynamic systems, liveness properties concern whether something good will eventually happen. Examples of liveness properties are termination of programs and goal achievability. In this paper, we consider the following theorem-proving problem: given

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d1190079596dbbef27570a8cb498cc67
https://doi.org/10.1609/aaai.v34i03.5679

First-order μ-calculus over generic transition systems and applications to the situation calculus

Autor: Giuseppe De Giacomo, Fabio Patrizi, Diego Calvanese, Marco Montali

Publikováno v: Information and Computation. 259:328-347

We consider μ L , μ L a , and μ L p , three variants of the first-order μ-calculus studied in verification of data-aware processes, that differ in the form of quantification on objects across states. Each of these three logics has a distinct noti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db6f8e1de6a32c75989bd376950799fa
https://doi.org/10.1016/j.ic.2017.08.007