Testing strong equivalence of datalog programs – implementation and examples

Authors:
Thomas Eiter;Wolfgang Faber;Patrick Traxler
Affiliations:
Institute of Information Systems, Vienna University of Technology, Vienna, Austria;Department of Mathematics, University of Calabria, Rende (CS), Italy;Institute of Information Systems, Vienna University of Technology, Vienna, Austria
Venue:
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Year:
2005

Citing 3
Cited 6

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
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
Strong equivalence made easy: nested expressions and weight constraints

Theory and Practice of Logic Programming

Strongly Equivalent Temporal Logic Programs

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Instantiation-Based Automated Reasoning: From Theory to Practice

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
Labelled unit superposition calculi for instantiation-based reasoning

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Model representation over finite and infinite signatures

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing it to the unsatisfiability problem of first-order formulas in the Bernays-Schönfinkel fragment. We then employ a tableaux-based theorem prover, which (unlike most other currently available provers) is guaranteed to terminate for these formulas. To the best of our knowledge, this is the first strong equivalence tester for disjunctive non-ground datalog.