Unfolding partiality and disjunctions in stable model semantics

DOI10.1145/1119439.1119440zbMATH Open1367.68035arXivcs/0303009OpenAlexW2056850725MaRDI QIDQ5277741

Jia-Huai You, Dietmar Seipel, Tomi Janhunen, Patrik Simons, Ilkka Niemelä

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Abstract: The paper studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementation of stable models for normal (disjunction-free) programs can be used as the core inference engine. The unfolding is done in two separate steps. Firstly, it is shown that partial stable models can be captured by total stable models using a simple linear and modular program transformation. Hence, reasoning tasks concerning partial stable models can be solved using an implementation of total stable models. Disjunctive partial stable models have been lacking implementations which now become available as the translation handles also the disjunctive case. Secondly, it is shown how total stable models of disjunctive programs can be determined by computing stable models for normal programs. Hence, an implementation of stable models of normal programs can be used as a core engine for implementing disjunctive programs. The feasibility of the approach is demonstrated by constructing a system for computing stable models of disjunctive programs using the smodels system as the core engine. The performance of the resulting system is compared to that of dlv which is a state-of-the-art special purpose system for disjunctive programs.

Full work available at URL: https://arxiv.org/abs/cs/0303009

zbMATH Keywords

answer set programmingquantified Boolean formulasminimal modelsinference enginepartial modelsdisjunctive stable models

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (28)

• The Intelligent Grounder of DLV
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
• Disjunctive answer set solvers via templates
• Omission-Based Abstraction for Answer Set Programs
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Semantics and complexity of recursive aggregates in answer set programming
• The Design of the Sixth Answer Set Programming Competition
• On elementary loops of logic programs
• Stable-unstable semantics: Beyond NP with normal logic programs
• Optimizing Answer Set Computation via Heuristic-Based Decomposition
• Synonymous theories and knowledge representations in answer set programming
• The power of non-ground rules in Answer Set Programming
• An incremental algorithm for generating all minimal models
• Abstraction for non-ground answer set programs
• A first order nonmonotonic extension of constructive logic
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• Dual-normal logic programs – the forgotten class
• Backdoors to Normality for Disjunctive Logic Programs
• Magic sets for disjunctive Datalog programs
• Parallel instantiation of ASP programs: techniques and experiments
• Logic programming as classical inference
• Design and results of the Fifth Answer Set Programming Competition
• Computing only minimal answers in disjunctive deductive databases
• Backdoors to tractable answer set programming
• Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results
• On acceptance conditions in abstract argumentation frameworks
• Complexity of super-coherence problems in ASP
• On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach

Uses Software

• ASSAT
• Smodels

This page was built for publication: Unfolding partiality and disjunctions in stable model semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277741)