Sciweavers

LPAR
2007
Springer
14 years 5 months ago
Completeness for Flat Modal Fixpoint Logics
Luigi Santocanale, Yde Venema
LPAR
2007
Springer
14 years 5 months ago
Algorithms for Propositional Model Counting
Marko Samer, Stefan Szeider
LPAR
2007
Springer
14 years 5 months ago
Permutative Additives and Exponentials
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
Gabriele Pulcini
LPAR
2007
Springer
14 years 5 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
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...
Roberto Maieli
LPAR
2007
Springer
14 years 5 months ago
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
Abstract. The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible ...
Michel Ludwig, Uwe Waldmann
LPAR
2007
Springer
14 years 5 months ago
Data Complexity in the EL Family of Description Logics
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...
Adila Krisnadhi, Carsten Lutz
LPAR
2007
Springer
14 years 5 months ago
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
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...
Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin
LPAR
2007
Springer
14 years 5 months ago
On Two Extensions of Abstract Categorial Grammars
Categorial Grammars Philippe de Groote, Sarah Maarek, Ryo Yoshinaka On Two Extensions of ACGs – p.1/45
Philippe de Groote, Sarah Maarek, Ryo Yoshinaka
LPAR
2007
Springer
14 years 5 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich