105 search results - page 6 / 21 » Automated Reasoning in Some Local Extensions of Ordered Stru... |
103
Voted
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
68
Voted
PLILP
1994
Springer
15 years 1 months ago
1994
Springer
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
85
Voted
ESSLLI
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
65
Voted
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...