In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
In 1990 J-L. Krivine introduced the notion of storage operators. They are -terms which simulate call-by-value in the call-by-name strategy and they can be used in order to modeliz...
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
In this paper, we incorporate concrete domain and action theory into a very expressive Description Logic (DL), called ALCQO. Notably, this extension can significantly augment the ...