Sciweavers

2148 search results - page 69 / 430
» From process logic to program logic
Sort
View
RC
2002
100views more  RC 2002»
13 years 10 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
ILP
2004
Springer
14 years 3 months ago
On Avoiding Redundancy in Inductive Logic Programming
ILP systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. The generation of redundant hypotheses ma...
Nuno A. Fonseca, Vítor Santos Costa, Fernan...
CADE
2006
Springer
14 years 10 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski
PEPM
2007
ACM
14 years 4 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
TACS
2001
Springer
14 years 2 months ago
A Logic Programming Language Based on Binding Algebras
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
Makoto Hamana