507 search results - page 82 / 102 » Automating first-order relational logic |
STOC
1999
ACM
14 years 3 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
CADE
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
TIME
2009
IEEE
14 years 5 months ago
2009
IEEE
—Past research on temporal databases has primarily focused on state-based representations and on relational query language extensions for such representations. This led to many d...
CIA
2007
Springer
14 years 5 months ago
2007
Springer
Recognizing that trust states are mental states, this paper presents a formal analysis of the dynamics of trust in terms of the functional roles and representation relations for tr...