Logic programs with monotone abstract constraint atoms

DOI10.1017/S147106840700302XzbMath1142.68018OpenAlexW2054159566MaRDI QIDQ5451971

Miroslaw Truszczynski, Victor W. Marek, Ilkka Niemelä

Publication date: 27 March 2008

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s147106840700302x

zbMATH Keywords

constraintslogic programsstable models

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (14)

Oscillating Behavior of Logic Programs ⋮ Characterizations of stable model semantics for logic programs with arbitrary constraint atoms ⋮ Argumentation-Based Semantics for Logic Programs with First-Order Formulae ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ Weight constraint programs with evaluable functions ⋮ Brave induction: a logical framework for learning from incomplete information ⋮ Unnamed Item ⋮ ASP (): Answer Set Programming with Algebraic Constraints ⋮ Logic programs with abstract constraint atoms: the role of computations ⋮ Relating weight constraint and aggregate programs: Semantics and representation ⋮ Answer Set Programming without Unstratified Negation ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP ⋮ Lparse Programs Revisited: Semantics and Representation of Aggregates

Uses Software

• ASSAT
• PBS
• Smodels
• Lparse

Cites Work

• Knowledge Representation, Reasoning and Declarative Problem Solving

This page was built for publication: Logic programs with monotone abstract constraint atoms