Efficient Approximation of Well-Founded Justification and Well-Founded Domination

DOI10.1007/978-3-642-40564-8_28zbMATH Open1405.68047OpenAlexW2283510762MaRDI QIDQ2851261

Toby Walsh, Christian Drescher

Publication date: 10 October 2013

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40564-8_28

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Recommendations

• Title not available (Why is that?) 👍 👎
• Lower complexity bounds in justification logic 👍 👎
• Approximating satisfiable satisfiability problems (extended abstract) 👍 👎
• On approximation by \(^{\oplus}\)-OBDDs 👍 👎
• Approximating satisfiable satisfiability problems 👍 👎
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning 👍 👎
• Approximate Satisfiability and Equivalence 👍 👎
• Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs 👍 👎
• Effective Finite-Valued Approximations of General Propositional Logics 👍 👎

This page was built for publication: Efficient Approximation of Well-Founded Justification and Well-Founded Domination

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