Sciweavers

827 search results - page 25 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
CORR
2012
Springer
188views Education» more  CORR 2012»
12 years 3 months ago
A Logical Characterization of Constraint-Based Causal Discovery
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
Tom Claassen, Tom Heskes
AAAI
2012
11 years 10 months ago
A Multi-Path Compilation Approach to Contingent Planning
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
Ronen I. Brafman, Guy Shani
WOLLIC
2009
Springer
14 years 2 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
DEXA
2009
Springer
109views Database» more  DEXA 2009»
14 years 2 months ago
Inclusion Dependencies in XML: Extending Relational Semantics
In this article we define a new type of integrity constraint in XML, called an XML inclusion constraint (XIND), and show that it extends the semantics of a relational inclusion de...
Michael Karlinger, Millist W. Vincent, Michael Sch...
CORR
2011
Springer
170views Education» more  CORR 2011»
12 years 11 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano