4617 search results - page 777 / 924 » Automation of Diagrammatic Reasoning |
191
click to vote
LOPSTR
1997
Springer
15 years 11 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
189
click to vote
LPKR
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
202
click to vote
LICS
1994
IEEE
15 years 11 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 ...
174
click to vote
ICLP
1992
Springer
15 years 11 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...
221
click to vote
KR
1992
Springer
15 years 11 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...