134 search results - page 6 / 27 » Meronymy Extraction Using An Automated Theorem Prover |
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
ATVA
2004
Springer
15 years 1 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
111
click to vote
ACSD
2001
IEEE
15 years 1 months ago
2001
IEEE
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
KBSE
1998
IEEE
15 years 1 months ago
1998
IEEE
Starting from a graphical data model (a subset of the OMT object model), a skeleton of formal specification can be generated and completed to express several constraints and provi...
ILP
1998
Springer
15 years 1 months ago
1998
Springer
Cohen's [1] refinement rules provide a flexible mechanism for introducing intentional background knowledge in an ILP system. Whereas Cohen used a limited second order theorem ...