Sciweavers

9532 search results - page 74 / 1907
» Logic, Graphs, and Algorithms
Sort
View
86
Voted
DLOG
2001
15 years 16 days ago
Description of the RACER System and its Applications
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized ...
Volker Haarslev, Ralf Möller
JAIR
1998
97views more  JAIR 1998»
14 years 10 months ago
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
Oleg Ledeniov, Shaul Markovitch
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 3 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
MFCS
2009
Springer
15 years 5 months ago
FO Model Checking on Nested Pushdown Trees
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
Alexander Kartzow
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 11 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari