6167 search results - page 269 / 1234 » Can Refinement be Automated |
225
click to vote
NLDB
2007
Springer
16 years 1 months ago
2007
Springer
Realizing the Semantic Web involves creating ontologies, a tedious and costly challenge. Reuse can reduce the cost of ontology engineering. Ontologies already created in recent Sem...
208
Voted
JAR
2008
15 years 7 months ago
2008
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
213
click to vote
DLOG
2009
15 years 5 months ago
2009
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
183
Voted
TIME
2002
IEEE
16 years 9 days ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
173
Voted
CSL
2001
Springer
15 years 12 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...