2291 search results - page 281 / 459 » Logic Programming and Model Checking |
124
click to vote
ICSE
2004
IEEE-ACM
16 years 2 months ago
2004
IEEE-ACM
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is ba...
108
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
147
Voted
AAMAS
2011
Springer
14 years 9 months ago
2011
Springer
We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL...
134
Voted
LOGCOM
2010
14 years 9 months ago
2010
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
128
click to vote
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...