Unfolding partiality and disjunctions in stable model semantics
From MaRDI portal
Publication:5277741
DOI10.1145/1119439.1119440zbMath1367.68035arXivcs/0303009MaRDI 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)
Full work available at URL: https://arxiv.org/abs/cs/0303009
minimal models; answer set programming; quantified Boolean formulas; inference engine; partial models; disjunctive stable models
Related Items
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, 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, Synonymous theories and knowledge representations in answer set programming, Semantics and complexity of recursive aggregates in answer set programming, Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results, A first order nonmonotonic extension of constructive logic, Logic programming as classical inference, Design and results of the Fifth Answer Set Programming Competition, 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
Uses Software
