Sciweavers

778 search results - page 6 / 156
» Expressiveness and complexity of graph logic
Sort
View
ENTCS
2008
98views more  ENTCS 2008»
14 years 9 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
FUIN
2007
135views more  FUIN 2007»
14 years 9 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
72
Voted
DIAGRAMS
2004
Springer
15 years 2 months ago
Query Graphs with Cuts: Mathematical Foundations
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with...
Frithjof Dau
DLOG
2008
14 years 11 months ago
Paraconsistent Reasoning for Expressive and Tractable Description Logics
Abstract. Four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage th...
Yue Ma, Pascal Hitzler, Zuoquan Lin
CSL
2008
Springer
14 years 11 months ago
The Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
Anuj Dawar, Erich Grädel