Logic Programming and Nonmonotonic Reasoning
From MaRDI portal
Publication:5473965
DOI10.1007/11546207zbMath1152.68408OpenAlexW4376598721MaRDI QIDQ5473965
Publication date: 23 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11546207
Related Items (59)
Supportedly stable answer sets for logic programs with generalized atoms ⋮ Evaluating epistemic negation in answer set programming ⋮ Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version ⋮ Online Action Language $$o\mathcal {BC}$$+ ⋮ Infinitary Equilibrium Logic and Strong Equivalence ⋮ ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories ⋮ From Turner’s Logic of Universal Causation to the Logic of GK ⋮ Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming ⋮ Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ A generalization of the Lin-Zhao theorem ⋮ Equilibrium logic ⋮ Infinitary equilibrium logic and strongly equivalent logic programs ⋮ Temporal equilibrium logic: a survey ⋮ Model-based recasting in answer-set programming ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ A general framework for preferences in answer set programming ⋮ Program completion in the input language of GRINGO ⋮ On equivalence of infinitary formulas under the stable model semantics ⋮ Abstract gringo ⋮ Complexity and compilation of GZ-aggregates in answer set programming ⋮ A denotational semantics for equilibrium logic ⋮ An infinitary encoding of temporal equilibrium logic ⋮ First-order modular logic programs and their conservative extensions ⋮ Stable models for infinitary formulas with extensional atoms ⋮ Non-monotonic spatial reasoning with answer set programming modulo theories ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Revisiting Explicit Negation in Answer Set Programming ⋮ Relating Two Dialects of Answer Set Programming ⋮ Ordered completion for first-order logic programs on finite structures ⋮ Unnamed Item ⋮ Rule Calculus: Semantics, Axioms and Applications ⋮ A compositional typed higher-order logic with definitions ⋮ Verifying Tight Logic Programs with anthem and vampire ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs ⋮ Automated verification of state sequence invariants in general game playing ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Explaining Preferences and Preferring Explanations ⋮ Logic programs with abstract constraint atoms: the role of computations ⋮ Stable models and circumscription ⋮ From answer set logic programming to circumscription via logic of GK ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ Thirteen Definitions of a Stable Model ⋮ General default logic ⋮ Determining inference semantics for disjunctive logic programs ⋮ ASP-Core-2 Input Language Format ⋮ Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + ⋮ Gelfond-Zhang aggregates as propositional formulas ⋮ An abstract view on optimizations in SAT and ASP ⋮ The loop formula based semantics of description logic programs ⋮ On the Expressiveness of Temporal Equilibrium Logic ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ Forgetting auxiliary atoms in forks ⋮ Twelve Definitions of a Stable Model ⋮ Lparse Programs Revisited: Semantics and Representation of Aggregates ⋮ Semi-equilibrium models for paracoherent answer set programs
This page was built for publication: Logic Programming and Nonmonotonic Reasoning
