4573 search results - page 746 / 915 » Automated Reasoning |
134
click to vote
LICS
1994
IEEE
15 years 7 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
116
Voted
ICLP
1992
Springer
15 years 7 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
163
click to vote
KR
1992
Springer
15 years 7 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
120
click to vote
PLISP
1989
15 years 7 months ago
1989
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...
137
click to vote
ECSQARU
2007
Springer
15 years 7 months ago
2007
Springer
Many merging operators have been proposed to merge either flat or stratified knowledge bases. The result of merging by such an operator is a flat base (or a set of models of the me...