846 search results - page 67 / 170 » Rewrite-Based Decision Procedures |
IANDC
2006
14 years 12 months ago
2006
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT
107
click to vote
JELIA
2010
Springer
14 years 9 months ago
2010
Springer
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means o...
SEMWEB
2010
Springer
14 years 9 months ago
2010
Springer
This paper presents our work on supporting evaluation of integrity constraint issues in semantic web instance data. We propose an alternative semantics for the ontology language, i...
JELIA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Results in social choice theory such as the Arrow and GibbardSatterthwaite theorems constrain the existence of rational collective decision making procedures in groups of...
ROBOCUP
1999
Springer
15 years 4 months ago
1999
Springer
The underlying research topics and the architecture of the UBU team are briefly described. The aim of developing UBU is to subject a series of tools and procedures for agent decis...