Sciweavers

2519 search results - page 319 / 504
» Reasoning with Textual Cases
Sort
View
ENTCS
2007
108views more  ENTCS 2007»
15 years 6 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig
ENTCS
2007
75views more  ENTCS 2007»
15 years 6 months ago
Testing Planning Domains (without Model Checkers)
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning...
Franco Raimondi, Charles Pecheur, Guillaume Brat
JSAT
2006
108views more  JSAT 2006»
15 years 6 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
ESWA
2007
131views more  ESWA 2007»
15 years 6 months ago
Case-based selection of initialisation heuristics for metaheuristic examination timetabling
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...
Sanja Petrovic, Yong Yang, Moshe Dror
NGC
2006
Springer
102views Communications» more  NGC 2006»
15 years 6 months ago
Evaluation of Automatic Generation of Basic Stories
Abstract This paper presents an application that automatically generates basic stories: short texts that only narrate the main events of the plot. The system operates with a repres...
Federico Peinado, Pablo Gervás