Sciweavers

62 search results - page 7 / 13
» Ground Interpolation for Combined Theories
Sort
View
APLAS
2011
ACM
13 years 9 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
BIRTHDAY
2005
Springer
15 years 3 months ago
Fibring Logics: Past, Present and Future
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
Carlos Caleiro, Amílcar Sernadas, Cristina ...
CADE
2008
Springer
15 years 10 months ago
Engineering DPLL(T) + Saturation
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
AI
2008
Springer
14 years 8 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
ACL
2001
14 years 11 months ago
Resolving Ellipsis in Clarification
We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ...
Jonathan Ginzburg, Robin Cooper