Sciweavers

ICTAI
1993
IEEE
13 years 12 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
AGP
1993
IEEE
13 years 12 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
AGP
1993
IEEE
13 years 12 months ago
Static Analysis of Prolog with Cut
Abstract. This paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our...
Gilberto Filé, Sabina Rossi
AGP
1994
IEEE
13 years 12 months ago
An Abstract Interpretation Framework for (almost) Full Prolog
act Interpretation Framework for (almost) Full Prolog1 B. Le Charlier S. Rossi P. Van Hentenryck University of Namur University of Padova Brown University 21 rue Grandgagnage 7 via...
Baudouin Le Charlier, Sabina Rossi, Pascal Van Hen...
AGP
1994
IEEE
13 years 12 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
WLP
1997
Springer
13 years 12 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
WLP
1997
Springer
13 years 12 months ago
Extending Homeomorphic Embedding in the Context of Logic Programming
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
Michael Leuschel
WIA
1997
Springer
13 years 12 months ago
In Vitro Implementation of Finite-State Machines
Abstract. We explore the information processing capabilities and efciency of DNA computations by giving two di erent types of implementations of nite-state machines. A ligation-bas...
Max H. Garzon, Y. Gao, John A. Rose, R. C. Murphy,...