Sciweavers

428 search results - page 81 / 86
» FPGA-Based SAT Solver
Sort
View
JELIA
2010
Springer
13 years 6 months ago
Decomposition of Distributed Nonmonotonic Multi-Context Systems
Multi-Context Systems (MCS) are formalisms that enable the interlinkage of single knowledge bases, called contexts, via bridge rules. Recently, the evaluation of heterogeneous, no...
Seif El-Din Bairakdar, Minh Dao-Tran, Thomas Eiter...
LPAR
2010
Springer
13 years 5 months ago
Semiring-Induced Propositional Logic: Definition and Basic Algorithms
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
Javier Larrosa, Albert Oliveras, Enric Rodrí...
ECAI
2010
Springer
13 years 5 months ago
On Computing Backbones of Propositional Theories
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
João Marques-Silva, Mikolás Janota, ...
JAIR
2011
103views more  JAIR 2011»
13 years 2 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
DAC
2004
ACM
14 years 8 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening