4617 search results - page 419 / 924 » Automation of Diagrammatic Reasoning |
188
click to vote
ICAIL
2005
ACM
16 years 10 days ago
2005
ACM
Computational law is an approach to automated legal reasoning focusing on semantically rich laws, regulations, contract terms, and business rules in the context of electronicallym...
178
click to vote
LPAR
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
191
click to vote
CP
2003
Springer
16 years 11 hour ago
2003
Springer
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
140
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
163
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. ...