Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
We give a monadic semantics in the category of FM-cpos to a higher-order CBV language with recursion and dynamically allocated mutable references that may store both ground data an...
Abstract. In this paper, we introduce a general and modular framework for formalizing reasoning with incomplete and inconsistent information. Our framework is composed of non-deter...
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses -tree syntax to treat object ...