Sciweavers

1036 search results - page 63 / 208
» Incompleteness of Behavioral Logics
Sort
View
CADE
2009
Springer
14 years 9 months ago
Ground Interpolation for Combined Theories
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
Amit Goel, Sava Krstic, Cesare Tinelli
CADE
2002
Springer
14 years 9 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
SARA
2007
Springer
14 years 2 months ago
Extensional Reasoning
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
Timothy L. Hinrichs
ACISICIS
2005
IEEE
14 years 2 months ago
Modeling Uncertainty in Context-Aware Computing
Uncertainty always exists as an unavoidable factor in any pervasive context-aware applications. This is mostly caused by the imperfectness and incompleteness of data. In this pape...
Binh An Truong, Young-Koo Lee, Sungyoung Lee
NSPW
2004
ACM
14 years 2 months ago
A qualitative framework for Shannon information theories
This paper presents a new paradigm for information theory which is a synthesis of Barwise-Seligman’s qualitative theory and Shannon’s quantitative theory. The new paradigm is ...
Gerard Allwein