Sciweavers

517 search results - page 43 / 104
» Using dynamic logic programming to model legal reasoning
Sort
View
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
AAMAS
2005
Springer
13 years 8 months ago
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
Marcela Capobianco, Carlos Iván Chesñ...
AAAI
2000
13 years 9 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
POLICY
2007
Springer
14 years 2 months ago
Proteus: A Semantic Context-Aware Adaptive Policy Model
The growing diffusion of portable devices enables users to benefit from anytime and anywhere impromptu collaboration. Appropriate policy models that take into account the dynamici...
Alessandra Toninelli, Rebecca Montanari, Lalana Ka...
FMOODS
2008
13 years 9 months ago
VeriCool: An Automatic Verifier for a Concurrent Object-Oriented Language
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...
Jan Smans, Bart Jacobs 0002, Frank Piessens