Sciweavers

57 search results - page 4 / 12
» A monadic approach to polycategories
Sort
View
LPAR
2010
Springer
14 years 7 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
ICLP
2007
Springer
15 years 3 months ago
Logic Programming Approach to Automata-Based Decision Procedures
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
Gulay Ünel, David Toman
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 7 months ago
Recursive Definitions of Monadic Functions
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
Alexander Krauss
GI
2009
Springer
14 years 7 months ago
Towards a Parallel Search for Solutions of Non-deterministic Computations
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
Fabian Reck, Sebastian Fischer