4617 search results - page 381 / 924 » Automation of Diagrammatic Reasoning |
112
click to vote
DLOG
1996
15 years 8 months ago
1996
Designing a DL system poses the problem of the trade-o between power of expression and complexity. In spite of their rich expressive capacity, the or and not constructors are usua...
144
click to vote
DLOG
1996
15 years 8 months ago
1996
Several significant problems exist whenapplying knowledge representation systems to real problems. In particular, the obscurity of LISP, the resource consumption, garbage collecti...
175
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
166
Voted
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We investigate a modification of the sequent calculus which s a first-order proof into its abstract deductive structure and a unifier which renders this structure a valid proof. We...
181
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...