Sciweavers

345 search results - page 24 / 69
» Kripke models for classical logic
Sort
View
AAAI
2010
13 years 9 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
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...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou
ATAL
2010
Springer
13 years 7 months ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
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...
AML
2000
82views more  AML 2000»
13 years 7 months ago
Mixed logic and storage operators
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...
Karim Nour
POPL
2006
ACM
14 years 8 months ago
A fixpoint calculus for local and global program flows
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...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
WWW
2008
ACM
14 years 8 months ago
A logical framework for modeling and reasoning about semantic web services contract
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 ...
Hai Liu, Qing Li, Naijie Gu, An Liu