4513 search results - page 274 / 903 » Logic programming with satisfiability |
125
click to vote
FORTE
2008
15 years 5 months ago
2008
Abstract. Model generation is an important formal technique for finding interesting instances of computationally hard problems. In this paper we study model generation over Horn lo...
128
click to vote
KI
2006
Springer
15 years 4 months ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
124
click to vote
ENTCS
2002
15 years 4 months ago
2002
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
146
click to vote
CHI
2005
ACM
16 years 4 months ago
2005
ACM
Recent years have seen the evolution of networks of tiny low power computing blocks, known as sensor networks. In one class of sensor networks, a non-expert user, who has little o...
152
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...