Sciweavers

113 search results - page 2 / 23
» A Minimal Propositional Type Theory
Sort
View
CORR
2011
Springer
170views Education» more  CORR 2011»
12 years 9 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
ECAI
2010
Springer
13 years 2 months ago
On Computing Backbones of Propositional Theories
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
João Marques-Silva, Mikolás Janota, ...
LREC
2010
139views Education» more  LREC 2010»
13 years 6 months ago
PASSAGE Syntactic Representation: a Minimal Common Ground for Evaluation
The current PASSAGE syntactic representation is the result of 9 years of constant evolution with the aim of providing a common ground for evaluating parsers of French whatever the...
Anne Vilnat, Patrick Paroubek, Eric Villemonte de ...
LPAR
2000
Springer
13 years 8 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob
ICLP
2007
Springer
13 years 11 months ago
Minimal Logic Programs
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Pedro Cabalar, David Pearce, Agustín Valver...