884 search results - page 68 / 177 » A Proof Theory for DL-Lite |
188
click to vote
TYPES
1995
Springer
15 years 9 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
158
click to vote
APAL
2008
15 years 6 months ago
2008
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
175
click to vote
JCSS
2008
15 years 6 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
150
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
147
click to vote
APAL
2007
15 years 6 months ago
2007
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...