Temporal logic programs with variables
From MaRDI portal
Publication:4593085
Abstract: In this note we consider the problem of introducing variables in temporal logic programs under the formalism of "Temporal Equilibrium Logic" (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of TEL that shares the syntax of first-order Linear-time Temporal Logic (LTL) but has a different semantics, selecting some LTL models we call "temporal stable models". Then, we consider a subclass of theories (called "splittable temporal logic programs") that are close to usual logic programs but allowing a restricted use of temporal operators. In this setting, we provide a syntactic definition of "safe variables" that suffices to show the property of "domain independence" -- that is, addition of arbitrary elements in the universe does not vary the set of temporal stable models. Finally, we present a method for computing the derivable facts by constructing a non-temporal logic program with variables that is fed to a standard ASP grounder. The information provided by the grounder is then used to generate a subset of ground temporal rules which is equivalent to (and generally smaller than) the full program instantiation.
Recommendations
- scientific article; zbMATH DE number 4082943
- Temporal logic programming
- scientific article; zbMATH DE number 4119670
- scientific article; zbMATH DE number 3985193
- Temporal contextual logic programming
- scientific article; zbMATH DE number 947806
- On the expressiveness of temporal logic programming
- scientific article; zbMATH DE number 3901996
- Temporal disjunctive logic programming
- Temporal logic programs with temporal description logic axioms
Cites work
- A Revised Concept of Safety for General Answer Set Programs
- Equilibrium logic
- Logic programming and nonmonotonic reasoning. 11th international conference, LPNMR 2011, Vancouver, Canada, May 16--19, 2011. Proceedings
- Logic programs with stable model semantics as a constraint programming paradigm
- Loop formulas for splitable temporal logic programs
- Normal Form Nested Programs
- On the complexity of temporal equilibrium logic
- Strongly Equivalent Temporal Logic Programs
- The DLV system for knowledge representation and reasoning
- The Semantics of Predicate Logic as a Programming Language
Cited in
(3)
This page was built for publication: Temporal logic programs with variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593085)