Sciweavers

4370 search results - page 98 / 874
» Algebra of Logic Programming
Sort
View
IJCAI
1989
13 years 11 months ago
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Igor Rivin, Ramin Zabih
FAC
2010
259views more  FAC 2010»
13 years 8 months ago
An algebraic approach to the design of compilers for object-oriented languages
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
Adolfo Duran, Ana Cavalcanti, Augusto Sampaio
APLAS
2003
ACM
14 years 3 months ago
Constraint Functional Logic Programming for Origami Construction
We describe origami programming methodology based on constraint functional logic programming. The basic operations of origami are reduced to solving systems of equations which desc...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi
VL
2003
IEEE
149views Visual Languages» more  VL 2003»
14 years 3 months ago
A program visualization tool for program comprehension
At the beginning stage of programming education, comprehending program logics plays a more important role than capturing knowledge of a specific program language. In this paper, t...
Mikio Ohki, Yasuo Hosaka
LOPSTR
1997
Springer
14 years 2 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen