Unfolding partiality and disjunctions in stable model semantics

DOI10.1145/1119439.1119440MaRDI QIDQ5277741zbMATH OpenOpenAlexFDO

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

Publication date 12 July 2017

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

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

zbMATH Keywords

answer set programmingdisjunctive stable modelsinference engineminimal modelspartial modelsquantified Boolean formulas

Mathematics Subject Classification ID

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

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.

Recommendations

• scientific article; zbMATH DE number 25192
• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• On the partial semantics for disjunctive deductive databases
• scientific article; zbMATH DE number 1407680
• Logic Programming and Nonmonotonic Reasoning

Cited in

(29)

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

Describes a project that uses

Uses Software

• Smodels
• ASSAT

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)