LPAR
2007
Springer
13 years 10 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
LPAR
2007
Springer
13 years 10 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...
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible ...
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...