Efficient Approximation of Well-Founded Justification and Well-Founded Domination
From MaRDI portal
Publication:2851261
DOI10.1007/978-3-642-40564-8_28zbMATH Open1405.68047OpenAlexW2283510762MaRDI QIDQ2851261FDOQ2851261
Authors: Christian Drescher, Toby Walsh 
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
Recommendations
- Approximate satisfiability and equivalence
- scientific article; zbMATH DE number 4008363
- Lower complexity bounds in justification logic
- Approximating satisfiable satisfiability problems (extended abstract)
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- Approximating satisfiable satisfiability problems
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- On approximation by \(^{\oplus}\)-OBDDs
- Effective Finite-Valued Approximations of General Propositional Logics
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
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)
