Sciweavers

24 search results - page 5 / 5
» Finding bugs efficiently with a SAT solver
Sort
View
ECAI
2010
Springer
13 years 2 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, ...
ICCBR
2009
Springer
13 years 2 months ago
Constraint-Based Case-Based Planning Using Weighted MAX-SAT
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
Hankui Zhuo, Qiang Yang, Lei Li
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 2 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
ATAL
2010
Springer
13 years 5 months ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...