Non-Monotonic Reasoning

From International Center for Computational Logic
Toggle side column

Non-Monotonic Reasoning

Entailment in classical logics (e.g. first-order predicate logic) is montone, that is, if a formula F follows from a set S of formulas, then F also follows from any superset of S.

Non-monotonic reasoning is concerned with entailment relations that do not satisfy monotonicity. Such relations can be used to model default assumptions (such as “delivery is free of charge unless stated otherwise”), rules with exceptions (e.g. “birds typically fly, but penguins do not fly”) or priorities between rules (e.g. federal law trumping state law).

The research area investigates the formal modelling of various approaches to non-monotonic reasoning, analyses and compares such entailment relations and also deals with implementations and applications, e.g. in knowledge representation, logic programming, legal reasoning, or Natural-Language Understanding.

Scientific Staff

Journal Articles

Proceedings Articles

Stefan Ellmauthaler, Markus Krötzsch, Stephan Mennicke
Answering Queries with Negation over Existential Rules
Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 5626-5633, June 2022
Details Download
Sarah Alice Gaggl, Philipp Hanisch, Markus Krötzsch
Simulating Sets in Answer Set Programming
In Luc De Raedt, eds., Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2634--2640, 2022.
Details Download

School of Embedded Composite Artificial Intelligence

Abstract Dialectical Frameworks solved with Binary Decision Diagrams