Sciweavers

2067 search results - page 81 / 414
» Logics of propositional control
Sort
View
AAAI
2006
15 years 3 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski
125
Voted
AAAI
2006
15 years 3 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
110
Voted
ANLP
2000
123views more  ANLP 2000»
15 years 3 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay
JSAT
2006
73views more  JSAT 2006»
15 years 1 months ago
Impurity: Another Phase Transition of SAT
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Eliezer L. Lozinskii