Relative expressiveness of defeasible logics

DOI10.1017/S1471068412000294MaRDI QIDQ4911149zbMATH OpenOpenAlexFDO

Authors Michael J. Maher

Publication date 13 March 2013

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.1785

zbMATH Keywords

defeasible logicnon-monotonic reasoningrelative expressiveness

Mathematics Subject Classification ID

Logic programming (68N17)

Abstract: We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be modular, in the sense that they also work if applied only to part of a theory, in order to achieve a useful notion of relative expressiveness. We present simulations showing that logics in DL with and without the capability of team defeat are equally expressive. We also show that logics that handle ambiguity differently -- ambiguity blocking versus ambiguity propagating -- have distinct expressiveness, with neither able to simulate the other under a different formulation of expressiveness.

Recommendations

• Relative expressiveness of defeasible logics. II
• scientific article; zbMATH DE number 1696797
• Comparing defeasible logics
• scientific article; zbMATH DE number 2087247
• scientific article; zbMATH DE number 1269578
• Representation results for defeasible logic
• Well-founded semantics for defeasible logic
• Expressiveness and succinctness of a logic of robustness
• scientific article; zbMATH DE number 1884386

Cites work

• A logic for default reasoning
• An inclusion theorem for defeasible logics
• Computational complexity and constraint logic programming languages
• Embedding as a tool for language comparison
• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• On the expressive power of programming languages
• Representation results for defeasible logic
• Some (in)translatability results for normal logic programs and propositional theories
• The next 700 programming languages
• What Are the Necessity Rules in Defeasible Reasoning?

Cited in

(5)

• Deciding whether a relation defined in Presburger logic can be defined in weaker logics
• Annotated defeasible logic
• Rethinking defeasible reasoning: a scalable approach
• Comparing defeasible logics
• Relative expressiveness of defeasible logics. II

This page was built for publication: Relative expressiveness of defeasible logics

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