Sciweavers

2302 search results - page 118 / 461
» Basic Description Logics
Sort
View
155
Voted
CIE
2006
Springer
15 years 7 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
ICTAC
2005
Springer
15 years 9 months ago
A Rewriting Logic Sampler
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
José Meseguer
MUC
1991
15 years 7 months ago
University of Massachusetts: description of the CIRCUS system as used for MUC-3
ind this work was to extract a relatively abstract level of information from each sentence , using only a limited vocabulary that was hand-crafted to handle a restricted set of tar...
Wendy G. Lehnert, Claire Cardie, David Fisher, Ell...
CADE
2006
Springer
15 years 7 months ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez
APAL
2010
111views more  APAL 2010»
15 years 4 months ago
Resource modalities in tensor logic
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more prim...
Paul-André Melliès, Nicolas Tabareau