Quantified Equilibrium Logic and Foundations for Answer Set Programs

DOI10.1007/978-3-540-89982-2_46MaRDI QIDQ5504679zbMATH OpenOpenAlexFDO

Authors

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89982-2_46

Mathematics Subject Classification ID

Logic programming (68N17) Intermediate logics (03B55) Logic in computer science (03B70)

Recommendations

• Interpolable formulas in equilibrium logic and answer set programming
• Infinitary equilibrium logic and strongly equivalent logic programs
• Quantified logic programs, revisited
• Answer set programming in intuitionistic logic
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Quantitative Logic Programming Revisited
• A denotational semantics for equilibrium logic
• Foundations of equational logic programming

Cites work

• scientific article; zbMATH DE number 1612562 (Why is no real title available?)
• scientific article; zbMATH DE number 559756 (Why is no real title available?)
• scientific article; zbMATH DE number 2085248 (Why is no real title available?)
• A Characterization of Strong Equivalence for Logic Programs with Variables
• A first order nonmonotonic extension of constructive logic
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
• Equilibrium logic
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming and Nonmonotonic Reasoning
• Logic and structure
• Logics in Artificial Intelligence
• Minimal Logic Programs
• Open answer set programming with guarded programs
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Strongly equivalent logic programs

Cited in

(25)

• Semi-equilibrium models for paracoherent answer set programs
• Equilibrium graphs
• On the relation between SPARQL1.1 and Answer Set Programming
• Stable Models for Temporal Theories
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
• Answer Set Programming: A Primer
• Synonymous theories and knowledge representations in answer set programming
• Loop-separable programs and their first-order definability
• Partial Functions and Equality in Answer Set Programming
• Abstraction for non-ground answer set programs
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Modular paracoherent answer sets
• Linear-time temporal answer set programming
• Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
• Modular answer set programming as a formal specification language
• Logics in Artificial Intelligence
• Metric temporal equilibrium logic over timed traces
• Temporal equilibrium logic with past operators
• Temporal here and there
• Metric temporal answer set programming over timed traces
• Connecting first-order ASP and the logic FO(ID) through reducts
• Deontic equilibrium logic with explicit negation
• An infinitary encoding of temporal equilibrium logic

This page was built for publication: Quantified Equilibrium Logic and Foundations for Answer Set Programs

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