Nested expressions in logic programs
From MaRDI portal
Publication:1978013
DOI10.1023/A:1018978005636zbMath0940.68075OpenAlexW1694306392MaRDI QIDQ1978013
Lappoon R. Tang, Hudson Turner, Vladimir Lifschitz
Publication date: 7 June 2000
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018978005636
Related Items
On elementary loops of logic programs ⋮ Witnesses for Answer Sets of Logic Programs ⋮ Evaluating epistemic negation in answer set programming ⋮ A Formal Theory of Justifications ⋮ Here and There among Logics for Logic Programming ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Finding similar/diverse solutions in answer set programming ⋮ Expressiveness of communication in answer set programming ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ A generalization of the Lin-Zhao theorem ⋮ Equilibrium logic ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ Semantic forgetting in answer set programming ⋮ A characterization of answer sets for logic programs ⋮ Answer set programming based on propositional satisfiability ⋮ Improving the Normalization of Weight Rules in Answer Set Programs ⋮ Preserving Strong Equivalence while Forgetting ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ Abstract gringo ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ A first polynomial non-clausal class in many-valued logic ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Revisiting Explicit Negation in Answer Set Programming ⋮ Ordered completion for first-order logic programs on finite structures ⋮ Computing weighted solutions in ASP: representation-based method vs. search-based method ⋮ What is answer set programming to propositional satisfiability ⋮ A qualitative temporal extension of here-and-there logic ⋮ On the limits of forgetting in answer set programming ⋮ Unnamed Item ⋮ Intelligent Instantiation and Supersafe Rules ⋮ Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints ⋮ ASP (): Answer Set Programming with Algebraic Constraints ⋮ Loop formulas for circumscription ⋮ Partial equilibrium logic ⋮ Relating constraint answer set programming languages and algorithms ⋮ Inferring phylogenetic trees using answer set programming ⋮ Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs ⋮ Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs ⋮ A logical approach to A-Prolog ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Cumulativity Tailored for Nonmonotonic Reasoning ⋮ Explaining Preferences and Preferring Explanations ⋮ From answer set logic programming to circumscription via logic of GK ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ Formalising the Fisherman's Folly puzzle ⋮ Thirteen Definitions of a Stable Model ⋮ Safe beliefs for propositional theories ⋮ General default logic ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Probabilistic reasoning with answer sets ⋮ Determining inference semantics for disjunctive logic programs ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ On Negative Unfolding in the Answer Set Semantics ⋮ Transition systems for model generators—A unifying approach ⋮ Computing defeasible meta-logic ⋮ An abstract view on optimizations in SAT and ASP ⋮ DualGrounder: lazy instantiation via clingo multi-shot framework ⋮ Autoepistemic equilibrium logic and epistemic specifications ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ Normal Form Nested Programs ⋮ A parallel memory-efficient epistemic logic program solver: harder, better, faster ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ Relating weight constraint and aggregate programs: Semantics and representation ⋮ Twelve Definitions of a Stable Model ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP ⋮ Possibilistic nested logic programs and strong equivalence ⋮ The possibilistic Horn non-clausal knowledge bases ⋮ A first order nonmonotonic extension of constructive logic ⋮ Semi-equilibrium models for paracoherent answer set programs
