Minimal Logic Programs
From MaRDI portal
Publication:3608649
DOI10.1007/978-3-540-74610-2_8zbMATH Open1213.68171OpenAlexW1843148560MaRDI QIDQ3608649FDOQ3608649
Authors:
Publication date: 5 March 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74610-2_8
Recommendations
Cited In (23)
- Temporal equilibrium logic: a survey
- SAT-Based Formula Simplification
- The Modal Logic of Equilibrium Models
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- On Minimal Models
- Equivalence for the \(G_3^\prime\)-stable models semantics
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- Smallest horn clause programs
- Title not available (Why is that?)
- A denotational semantics for equilibrium logic
- Title not available (Why is that?)
- On uniform equivalence of epistemic logic programs
- Title not available (Why is that?)
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
- Syntactic ASP forgetting with forks
- A syntactic operator for forgetting that satisfies strong persistence
- Forgetting auxiliary atoms in forks
- On syntactic forgetting under uniform equivalence
- Minimal Logicism
- Syntactic ASP forgetting with forks
- Capturing equilibrium models in modal logic
- Relating minimal models and pre-requisite-free normal defaults
- On the minimality of stable models
This page was built for publication: Minimal Logic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608649)
