Sciweavers

1205 search results - page 71 / 241
» Program Extraction from Large Proof Developments
Sort
View
JLP
2008
108views more  JLP 2008»
15 years 1 months ago
Composition mechanisms for retrenchment
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
Richard Banach, Czeslaw Jeske, Michael Poppleton
LPNMR
2005
Springer
15 years 7 months ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker
ACTAC
2002
75views more  ACTAC 2002»
15 years 1 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
ANOR
2002
67views more  ANOR 2002»
15 years 1 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
IMECS
2007
15 years 3 months ago
Knowledge Acquisition from Computer Log Files by ADG with Variable Agent Size
Abstract—We had previously proposed an outstanding evolutionary method, Automatically Defined Groups (ADG), for generating heterogeneous cooperative agents, and then we had deve...
Akira Hara, Yoshiaki Kurosawa, Takumi Ichimura