1549 search results - page 41 / 310 » On the rules of intermediate logics |
CADE
2008
Springer
14 years 9 months ago
2008
Springer
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
ECAI
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
ENTCS
2011
13 years 3 months ago
2011
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
FLOPS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
CONCUR
2007
Springer
14 years 3 months ago
2007
Springer
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...