Stable inference as intuitionistic validity
From MaRDI portal
Publication:4223455
Recommendations
- Effective validity: a generalized logic for stable approximate inference
- Inference to the stable explanations
- Stable formulas in intuitionistic logic
- Reasoning with infinite stable models
- Stable belief sets revisited
- scientific article; zbMATH DE number 4101147
- Stable reasoning
- Remarks on Stable Formulas in Intuitionistic Logic
- Stable modal logics
- scientific article; zbMATH DE number 512983
Cited in
(20)- Answer set programming in intuitionistic logic
- Safe beliefs for propositional theories
- An extension of the stable semantics via Lukasiewicz logic
- On the limits of forgetting in answer set programming
- A tableaux calculus for default intuitionistic logic
- Possibilistic nested logic programs and strong equivalence
- Semantics for possibilistic disjunctive programs
- Modality Argumentation Programming
- Brief study of G'3 logic
- First-order Answer Set Programming as Constructive Proof Search
- Model-based recasting in answer-set programming
- Stable reasoning
- scientific article; zbMATH DE number 1877044 (Why is no real title available?)
- A logical approach to A-Prolog
- Inconsistency proofs for ASP: the ASP-DRUPE format
- Fidel Semantics for Propositional and First-Order Version of the Logic of CG’3
- A new logical characterisation of stable models and answer sets
- Forgetting in answer set programming -- a survey
- Equilibrium logic
- Equivalence for the G₃^-stable models semantics
This page was built for publication: Stable inference as intuitionistic validity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223455)
