Sciweavers

2145 search results - page 136 / 429
» Lax Logical Relations
Sort
View
RTA
2005
Springer
14 years 4 months ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot
ALP
1997
Springer
14 years 2 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
ECP
1997
Springer
130views Robotics» more  ECP 1997»
14 years 2 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
CCL
1994
Springer
14 years 2 months ago
Application of Constraint Logic Programming for VLSI CAD Tools
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
Renate Beckmann, Ulrich Bieker, Ingolf Markhof
DIMACS
1996
14 years 2 days ago
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
Bruno Courcelle