Witnesses for Answer Sets of Logic Programs

DOI10.1145/3568955OpenAlexW4306873650MaRDI QIDQ5886522

Yisong Wang, Yuan Lin Zhang, Fangzhen Lin, Thomas Eiter

Publication date: 5 April 2023

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3568955

zbMATH Keywords

minimal modelslogic programminganswer set semanticswitness

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Uses Software

• Clingo
• PySAT
• lp2normal
• xclingo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-equilibrium models for paracoherent answer set programs
• On the query complexity of selecting minimal sets for monotone predicates
• Fast, flexible MUS enumeration
• On finding short resolution refutations and small unsatisfiable subsets
• Logic programs with abstract constraint atoms: the role of computations
• The intractability of resolution
• The complexity of facets resolved
• A logic of knowledge and justified assumption
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• PySAT: a Python toolkit for prototyping with SAT oracles
• Conflict-driven answer set solving: from theory to practice
• The complexity of selecting maximal solutions
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Nested expressions in logic programs
• Determining inference semantics for disjunctive logic programs
• Explanation in artificial intelligence: insights from the social sciences
• Modular construction of minimal models
• \textsc{lp2normal} -- a normalization tool for extended logic programs
• Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints
• Causal Graph Justifications of Logic Programs
• A Formal Theory of Justifications
• Many hard examples for resolution
• Catching the Ouroboros: On debugging non-ground answer-set programs
• Justifications for logic programs under answer set semantics
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The Semantics of Predicate Logic as a Programming Language
• Generating explanations for biomedical queries
• Justifying answer sets using argumentation
• Justifications for programs with disjunctive and causal-choice rules
• Stepwise debugging of answer-set programs
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• The External Interface for Extending WASP
• ASP-Core-2 Input Language Format
• Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
• Inconsistency Proofs for ASP: The ASP - DRUPE Format
• A Survey on the Explainability of Supervised Machine Learning
• Multi-shot ASP solving with clingo
• Answering the “why” in answer set programming – A survey of explanation approaches
• Debugging Non-ground ASP Programs: Technique and Graphical Tools
• Logic Programming and Nonmonotonic Reasoning
• Logic for Programming, Artificial Intelligence, and Reasoning
• Theory and Applications of Satisfiability Testing
• A Logical Theory of Causality

This page was built for publication: Witnesses for Answer Sets of Logic Programs