Sciweavers

439 search results - page 73 / 88
» Instantiation-Based Automated Reasoning: From Theory to Prac...
Sort
View
CSL
2007
Springer
15 years 3 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
LICS
2006
IEEE
15 years 3 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto
LICS
2005
IEEE
15 years 3 months ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux
IEEEICCI
2003
IEEE
15 years 3 months ago
Conceptual Framework for Interactive Ontology Building
Abstract— An ontology is a formal language adequately representing the knowledge used for reasoning in a specific environment. When contradictions arise and make ontologies inad...
Jean Sallantin, Jacques Divol, Patrice Duroux
ISMB
1993
14 years 11 months ago
Protein Sequencing Experiment Planning Using Analogy
Experiment design and execution is a central activity in the natural sciences. The SeqERsystem provides a general architecture for the integration of automated planning techniques...
Brian P. Kettler, Lindley Darden