Sciweavers

77 search results - page 13 / 16
» Reasoning by Cases without Contraposition in Default Logic
Sort
View
KR
2004
Springer
14 years 27 days ago
Inductive Situation Calculus
Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus using the Lo...
Marc Denecker, Eugenia Ternovska
SIGSOFT
2010
ACM
13 years 5 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
CADE
2011
Springer
12 years 7 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
DAC
2007
ACM
14 years 8 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
CADE
2009
Springer
14 years 8 months ago
Decidability Results for Saturation-Based Model Building
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
Matthias Horbach, Christoph Weidenbach