146 search results - page 17 / 30 » Modelling and solving temporal reasoning as propositional sa... |
LPNMR
2007
Springer
2007
Springer
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
14 years 2 months ago
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
CADE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
LORI
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a new type of arrow in the update frames (or “action models”) of Dynamic Epistemic Logic in a way that enables us to reason about epistemic temporal dynamics in m...
JUCS
2007
13 years 8 months ago
2007
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...