6167 search results - page 893 / 1234 » Can Refinement be Automated |
162
click to vote
ICLP
1997
Springer
15 years 9 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
152
Voted
LOPSTR
1997
Springer
15 years 9 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...
145
click to vote
LICS
1994
IEEE
15 years 9 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 ...
149
Voted
KR
1992
Springer
15 years 9 months ago
1992
Springer
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
126
click to vote
LPNMR
1990
Springer
15 years 9 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...