Add to ORKGIt is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logic programming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logic programming model of computation appropriate for the study of the run time of a wide variety of algorithms
Abstract machines provide a certain separation between platform-dependent and platform-independent ...
SIGLEKULeuven Campusbibliotheek Exacte Wetenschappen / UCL - Université Catholique de LouvainBEBelgi...
Two practical considerations concerning the use of computing machinery are the amount of information...
It is widely accepted that many algorithms can be concisely and clearly expressed as logical infere...
Abstract. Bottom-up logic programming can be used to declaratively specify many algorithms in a succ...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
International audienceThis article presents a schedulability analysis for real-time systems designed...
This dissertation describes research toward automatic complexity analysis of logic programs and its ...
We propose a new computation model which combines the operational principles of functional languages...
AbstractIn this paper we show how quantitative program logic (Morgan et al., ACM Trans. Programming ...
Algorithms are more and more made available as part of libraries or tool kits. For a user of such a ...
We propose several algorithms for ecient Testing of logical Implication in the case of ground objec...
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, ...
The paper proposes a technique for inferring conditions on goals that, when satisfied, ensure that a...
Algorithms are more and more made available as part of libraries or tool kits. For a user of such a ...
Abstract machines provide a certain separation between platform-dependent and platform-independent ...
SIGLEKULeuven Campusbibliotheek Exacte Wetenschappen / UCL - Université Catholique de LouvainBEBelgi...
Two practical considerations concerning the use of computing machinery are the amount of information...
It is widely accepted that many algorithms can be concisely and clearly expressed as logical infere...
Abstract. Bottom-up logic programming can be used to declaratively specify many algorithms in a succ...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
International audienceThis article presents a schedulability analysis for real-time systems designed...
This dissertation describes research toward automatic complexity analysis of logic programs and its ...
We propose a new computation model which combines the operational principles of functional languages...
AbstractIn this paper we show how quantitative program logic (Morgan et al., ACM Trans. Programming ...
Algorithms are more and more made available as part of libraries or tool kits. For a user of such a ...
We propose several algorithms for ecient Testing of logical Implication in the case of ground objec...
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, ...
The paper proposes a technique for inferring conditions on goals that, when satisfied, ensure that a...
Algorithms are more and more made available as part of libraries or tool kits. For a user of such a ...
Abstract machines provide a certain separation between platform-dependent and platform-independent ...
SIGLEKULeuven Campusbibliotheek Exacte Wetenschappen / UCL - Université Catholique de LouvainBEBelgi...
Two practical considerations concerning the use of computing machinery are the amount of information...