Sciweavers

851 search results - page 22 / 171
» Inaccessibility in Decision Procedures
Sort
View
JSC
2010
120views more  JSC 2010»
13 years 6 months ago
Theory decision by decomposition
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
Maria Paola Bonacina, Mnacho Echenim
CBMS
2007
IEEE
14 years 1 months ago
Temporal Constraints Approximation from Data about Medical Procedures
Proposing a treatment to patients is one of the physicians’ most common tasks. There are different elements that influence the decision of a physician to propose an appropriate ...
Aida Kamisalic, David Riaño, Francis Real, ...
FSTTCS
2004
Springer
14 years 29 days ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
DLOG
2008
13 years 10 months ago
A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
Hybrid EL-TBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept definitions, which are interpreted with greatest f...
Franz Baader, Novak Novakovik, Boontawee Suntisriv...
IPL
2006
109views more  IPL 2006»
13 years 7 months ago
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Aaron Stump, Bernd Löchner