Finite domain and symbolic inference methods for extensions of first-order logic

Authors:
Johan Wittocx
Affiliations:
Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium. E-mail: johan.wittocx@cs.kuleuven.be
Venue:
AI Communications
Year:
2011

Citing 4
Cited 1

A logic of nonmonotone inductive definitions

ACM Transactions on Computational Logic (TOCL)
Debugging for Model Expansion

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Grounding FO and FO(ID) with bounds

Journal of Artificial Intelligence Research
Towards computing revised models for FO theories

INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management

Grounding formulas with complex terms

Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this dissertation, we investigate various sorts of reasoning on finite structures and theories in the logic FO(·), a rich extension of classical logic with, amongst others, inductive definitions and aggregates. In particular, we study the tasks of constraint propagation, grounding, model revision, and debugging for FO(·).