Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
We introduce a Game Logic with Preferences (GLP), which makes it possible to reason about how information or assumptions about the preferences of other players can be used by agen...
Sieuwert van Otterloo, Wiebe van der Hoek, Michael...
Our previous work [26] introduced Belief Logic Programming (BLP), a novel form of quantitative logic programming with correlation of evidence. Unlike other quantitative approaches ...
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sa...
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...