4617 search results - page 783 / 924 » Automation of Diagrammatic Reasoning |
209
click to vote
DLOG
1998
15 years 8 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
187
click to vote
AAAI
1993
15 years 8 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
184
click to vote
DLOG
1996
15 years 8 months ago
1996
In 1995, I nished my Ph.D. project which was focused on the selection of adequate Knowledge-Representation Systems (KRSs) for research applications. When I started working at the ...
193
Voted
CSL
2010
Springer
15 years 8 months ago
2010
Springer
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
185
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...