The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
AI Communications - Special issue on the Swiss priority programme in informatics research, module knowledge-based systems
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Temporal equilibrium logic: a first approach
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Testing strong equivalence of datalog programs – implementation and examples
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
SELP – a system for studying strong equivalence between logic programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Loop formulas for splitable temporal logic programs
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Parametrized equilibrium logic
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Automata-Based computation of temporal equilibrium models
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Logical foundations for more expressive declarative temporal logic programming languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper analyses the idea of strong equivalence for transition systems represented as logic programs under the Answer Set Programming (ASP) paradigm. To check strong equivalence, we use a linear temporal extension of Equilibrium Logic (a logical characterisation of ASP) and its monotonic basis, the intermediate logic of Here-and-There (HT). Trivially, equivalence in this temporal extension of HT provides a sufficient condition for temporal strong equivalence and, as we show in the paper, it can be transformed into a provability test into the standard Linear Temporal Logic (LTL), something that can be automatically checked using any of the LTL available provers. The paper shows an example of the potential utility of this method by detecting some redundant rules in a simple actions reasoning scenario.