Sciweavers

4513 search results - page 606 / 903
» Logic programming with satisfiability
Sort
View
158
Voted
SAS
1995
Springer
127views Formal Methods» more  SAS 1995»
15 years 7 months ago
Complementation in Abstract Interpretation
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
Agostino Cortesi, Gilberto Filé, Roberto Gi...
ICAI
2004
15 years 5 months ago
Automatic Generation of English-language Steps in Puzzle Solving
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
Hemantha Ponnuru, Raphael A. Finkel, Victor W. Mar...
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 4 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
SIGSOFT
2005
ACM
16 years 5 months ago
Context- and path-sensitive memory leak detection
We present a context- and path-sensitive algorithm for detecting memory leaks in programs with explicit memory management. Our leak detection algorithm is based on an underlying e...
Yichen Xie, Alexander Aiken
CP
2009
Springer
16 years 4 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...