Sciweavers

949 search results - page 39 / 190
» Programmed Mutagenesis Is Universal
Sort
View
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 9 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 4 months ago
The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs
Plagiarism detection is a growing need among educational institutions and solutions for different purposes exist. An important field in this direction is detecting cases of source...
Johannes Oetsch, Jörg Pührer, Martin Sch...
EPIA
2009
Springer
15 years 11 months ago
Colored Nonograms: An Integer Linear Programming Approach
Abstract. In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black a...
Luís Mingote, Francisco Azevedo
TPHOL
1998
IEEE
15 years 8 months ago
Program Abstraction in a Higher-Order Logic Framework
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
Marco Benini, Sara Kalvala, Dirk Nowotka
EUROMICRO
1996
IEEE
15 years 8 months ago
Efficient Program Composition on Parix by the Ensemble Methodology
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
John Yiannis Cotronis