Sciweavers

69 search results - page 10 / 14
» Normal Form Results for Default Logic
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
14 years 9 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
IJAR
2010
91views more  IJAR 2010»
14 years 8 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
ICALP
2000
Springer
15 years 1 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 1 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
CSR
2006
Springer
15 years 1 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere