Sciweavers

446 search results - page 73 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
CADE
2002
Springer
14 years 7 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
NMR
2004
Springer
14 years 26 days ago
Preferential defeasibility: utility in defeasible logic programming
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
Fernando A. Tohmé, Guillermo Ricardo Simari
IJCAI
1993
13 years 8 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
DLOG
2008
13 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
LICS
2005
IEEE
14 years 1 months ago
Modal Characterisation Theorems over Special Classes of Frames
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...
Anuj Dawar, Martin Otto