Quantified Equilibrium Logic and Foundations for Answer Set Programs

DOI10.1007/978-3-540-89982-2_46zbMath1185.68175OpenAlexW1567216075MaRDI QIDQ5504679

No author found.

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 in computer science (03B70) Logic programming (68N17) Intermediate logics (03B55)

Related Items (19)

Stable Models for Temporal Theories ⋮ Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ Modular Paracoherent Answer Sets ⋮ On the relation between SPARQL1.1 and Answer Set Programming ⋮ Temporal Equilibrium Logic with past operators ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ An infinitary encoding of temporal equilibrium logic ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Synonymous theories and knowledge representations in answer set programming ⋮ Metric temporal answer set programming over timed traces ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ ASP (): Answer Set Programming with Algebraic Constraints ⋮ Loop-separable programs and their first-order definability ⋮ Abstraction for non-ground answer set programs ⋮ Answer Set Programming: A Primer ⋮ Equilibrium graphs ⋮ Temporal Here and There ⋮ Quantified Equilibrium Logic and Foundations for Answer Set Programs ⋮ Semi-equilibrium models for paracoherent answer set programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A first order nonmonotonic extension of constructive logic
• Equilibrium logic
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Minimal Logic Programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Open answer set programming with guarded programs
• Logics in Artificial Intelligence
• Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Logic Programming and Nonmonotonic Reasoning
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Strongly equivalent logic programs
• Logic and structure

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