Sciweavers

9532 search results - page 12 / 1907
» Logic, Graphs, and Algorithms
Sort
View
JAR
2007
132views more  JAR 2007»
13 years 9 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
14 years 4 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
COMMA
2008
13 years 11 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter
GLVLSI
2007
IEEE
167views VLSI» more  GLVLSI 2007»
14 years 4 months ago
A new approach to logic synthesis of multi-output boolean functions on pal-based CPLDS
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
Dariusz Kania
CSL
2009
Springer
14 years 4 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer