Witnesses for Answer Sets of Logic Programs

DOI10.1145/3568955MaRDI QIDQ5886522zbMATH OpenOpenAlexWikidataFDO

Authors Yisong Wang, Thomas Eiter, Yuanlin Zhang, Fangzhen Lin

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

answer set semanticslogic programmingminimal modelswitness

Mathematics Subject Classification ID

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

Recommendations

• A characterization of answer sets for logic programs
• Justifications for Logic Programs Under Answer Set Semantics
• Justifications for logic programs under answer set semantics
• A theory of observables for logic programs
• scientific article; zbMATH DE number 6536279
• Answer sets for logic programs with arbitrary abstract constraint atoms
• Answer set programming in intuitionistic logic
• The witness properties and the semantics of the Prolog cut
• Logic Programming and Nonmonotonic Reasoning
• Observable behaviors and equivalences of logic programs

Cites work

• \textsc{lp2normal} -- a normalization tool for extended logic programs
• A formal theory of justifications
• A logic of knowledge and justified assumption
• A logical theory of causality
• A survey on the explainability of supervised machine learning
• Answering the ``why in answer set programming -- a survey of explanation approaches
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• ASP-Core-2 input language format
• Catching the Ouroboros: on debugging non-ground answer-set programs
• Causal graph justifications of logic programs
• Conflict-driven answer set solving: from theory to practice
• Debugging non-ground ASP programs with choice rules, cardinality and weight constraints
• Debugging non-ground ASP programs: technique and graphical tools
• Determining inference semantics for disjunctive logic programs
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Explanation in artificial intelligence: insights from the social sciences
• Fast, flexible MUS enumeration
• Generating explanations for biomedical queries
• scientific article; zbMATH DE number 440477 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1531964 (Why is no real title available?)
• scientific article; zbMATH DE number 7455706 (Why is no real title available?)
• scientific article; zbMATH DE number 7455713 (Why is no real title available?)
• Inconsistency proofs for ASP: the ASP-DRUPE format
• Justifications for logic programs under answer set semantics
• Justifications for programs with disjunctive and causal-choice rules
• Justifying answer sets using argumentation
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Logic for Programming, Artificial Intelligence, and Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with abstract constraint atoms: the role of computations
• Many hard examples for resolution
• Modular construction of minimal models
• Multi-shot ASP solving with clingo
• Nested expressions in logic programs
• On finding short resolution refutations and small unsatisfiable subsets
• On the computational cost of disjunctive logic programming: Propositional case
• On the query complexity of selecting minimal sets for monotone predicates
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• Proceedings of the 36th international conference on logic programming (technical communications), ICLP 2020, UNICAL, Rende (CS), Italy, September 18--24, 2020
• Propositional semantics for disjunctive logic programs
• PySAT: a Python toolkit for prototyping with SAT oracles
• Semi-equilibrium models for paracoherent answer set programs
• Stepwise debugging of answer-set programs
• The complexity of facets resolved
• The complexity of selecting maximal solutions
• The External Interface for Extending WASP
• The intractability of resolution
• The Semantics of Predicate Logic as a Programming Language
• Theory and Applications of Satisfiability Testing
• Unifying justifications and debugging for answer-set programs
• Unsatisfiable core analysis and aggregates for optimum stable model search

Cited in

(2)

• Contrastive explanations for answer-set programs
• Hypergraphs in logic programming

Describes a project that uses

Uses Software

• Clingo
• PySAT
• lp2normal
• xclingo

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

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