Sciweavers

850 search results - page 38 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
PLILP
1992
Springer
15 years 5 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
PPDP
2007
Springer
15 years 7 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
IJAR
2007
96views more  IJAR 2007»
15 years 1 months ago
A paraconsistent logic programming approach for querying inconsistent databases
When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integra...
Sandra de Amo, Mônica Sakuray Pais
ICLP
2007
Springer
15 years 7 months ago
Core TuLiP Logic Programming for Trust Management
We propose CoreTuLiP - the core of a trust management language based on Logic Programming. CoreTuLiP is based on a subset of moded logic programming, but enjoys the features of TM ...
Marcin Czenko, Sandro Etalle
JAR
2010
95views more  JAR 2010»
14 years 8 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney