Reasoning about actions with Temporal Answer Sets
From MaRDI portal
(Redirected from Publication:5299584)
Abstract: In this paper we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal Answer Set for domain descriptions, based on the usual notion of Answer Set. Also, we provide a translation of domain descriptions into standard ASP and we use Bounded Model Checking techniques for the verification of DLTL constraints.
Recommendations
- scientific article; zbMATH DE number 1249651
- Reasoning about actions in dynamic linear time temporal logic
- Reasoning about actions with \(\mathcal{EL}\) ontologies and temporal answer sets for DLTL
- scientific article; zbMATH DE number 1361129
- The Expressive Power of Temporal Logic of Actions
- scientific article; zbMATH DE number 140396
- Temporal answer set programming
- Temporal Reasoning over Deontic Specifications
- scientific article; zbMATH DE number 1090097
- scientific article; zbMATH DE number 1476493
Cites work
- A logic programming approach to knowledge-state planning, semantics and complexity
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- Approximation of action theories and its application to conformant planning
- Bounded LTL model checking with stable models
- Creating collective intention through dialogue
- Diagnostic reasoning with A-Prolog
- Domain-dependent knowledge in answer set planning
- Dynamic linear time temporal logic
- Frames in the space of situations
- GOLOG: A logic programming language for dynamic domains
- Nonmonotonic causal theories
- Planning control rules for reactive agents
- Planning for temporally extended goals.
- Planning with preferences using logic programming
- Reasoning with infinite stable models
- Representing action and change by logic programs
- Specifying and verifying interaction protocols in a temporal action logic
- Tableau-based automata construction for dynamic linear time temporal logic
- The DLV system for knowledge representation and reasoning
- Using temporal logics to express search control knowledge for planning
Cited in
(9)- Reasoning about actions with \(\mathcal{EL}\) ontologies and temporal answer sets for DLTL
- Reasoning about actions in dynamic linear time temporal logic
- On the expressiveness of temporal equilibrium logic
- Achieving completeness in the verification of action theories by bounded model checking in ASP
- scientific article; zbMATH DE number 1476493 (Why is no real title available?)
- Temporal answer set programming on finite traces
- Business process verification with constraint temporal answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Linear-time temporal answer set programming
This page was built for publication: Reasoning about actions with Temporal Answer Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299584)
