scientific article; zbMATH DE number 1931670

MaRDI QIDQ4708928zbMATH OpenFDO

Authors Torsten Schaub, Hans Tompits, Stefan Woltran, P. Besnard

Publication date 20 June 2003

Full work available at URL https://arxiv.org/abs/cs/0207084, http://link.springer.de/link/service/series/0558/bibs/2424/24240320.htm

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Logic in artificial intelligence (68T27)

Recommendations

• Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
• Signed systems for paraconsistent reasoning
• Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories
• A simple signed system for paraconsistent reasoning
• Inconsistency Tolerance
• scientific article; zbMATH DE number 4142013
• scientific article; zbMATH DE number 912317
• scientific article; zbMATH DE number 2213620
• Taming paraconsistent (and other) logics: an algorithmic approach
• scientific article; zbMATH DE number 60834

Cited in

(9)

• Signed systems for paraconsistent reasoning
• Predicate signatures from pair encodings via dual system proof technique
• A QBF-based formalization of abstract argumentation semantics
• Computational methods for database repair by signed formulae
• A simple signed system for paraconsistent reasoning
• Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
• Inconsistency Tolerance
• Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories
• Expressiveness of SETAFs and support-free ADFs under 3-valued semantics

This page was built for publication:

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