Sciweavers

183 search results - page 15 / 37
» A Prolog Implementation of Kem
Sort
View
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 2 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
IPPS
1998
IEEE
13 years 11 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
IJIT
2004
13 years 9 months ago
Formal Verification of a Multicast Protocol In Mobile Networks
As computer network technology becomes increasingly complex, it becomes necessary to place greater requirements on the validity of developing standards and the resulting technology...
Mohammad Reza Matash Borujerdi, S. M. Mirzababaei
CORR
2007
Springer
172views Education» more  CORR 2007»
13 years 7 months ago
A Data-Parallel Version of Aleph
This is to present work on modifying the Aleph ILP system so that it evaluates the hypothesised clauses in parallel by distributing the data-set among the nodes of a parallel or di...
Stasinos Konstantopoulos
ACL
1990
13 years 8 months ago
Automated Inversion of Logic Grammars for Generation
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
Tomek Strzalkowski, Ping Peng