Document - KLM-style defeasibility for restricted first-order logic

2022

Conference article Closed Access

KLM-style defeasibility for restricted first-order logic

Casini G., Meyer T., Paterson-Jones G., Varzinczak I.

First-order logic Datalog Non-monotonic reasoning

In this paper, we extend the KLM approach to defeasible reasoning beyond the propositional setting. We do so by making it applicable to a restricted version of first-order logic. We describe defeasibility for this logic using a set of rationality postulates, provide a suitable and intuitive semantics for it, and present a representation result characterising the semantic description of defeasibility in terms of our postulates. An advantage of our semantics is that it is sufficiently general to be applicable to other restricted versions of first-order logic as well. Based on this theoretical core, we then propose a version of defeasible entailment that is inspired by the well-known notion of Rational Closure as it is defined for defeasible propositional logic and defeasible description logics. We show that this form of defeasible entailment is rational in the sense that it adheres to the full set of rationality postulates.

Source: RuleML+RR 2022 - International Joint Conference on Rules and Reasoning, pp. 81–94, Berlin, Germany, 26-28/09/2022

Publisher: Springer, New York, USA

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:488500,
	title = {KLM-style defeasibility for restricted first-order logic},
	author = {Casini G. and Meyer T. and Paterson-Jones G. and Varzinczak I.},
	publisher = {Springer, New York, USA},
	doi = {10.1007/978-3-031-21541-4_6},
	booktitle = {RuleML+RR 2022 - International Joint Conference on Rules and Reasoning, pp. 81–94, Berlin, Germany, 26-28/09/2022},
	year = {2022}
}