154 search results - page 12 / 31 » Proof Complexity of Non-classical Logics |
106
click to vote
TPHOL
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
KRDB
2001
14 years 11 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
114
click to vote
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
LPAR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...