Sciweavers

293 search results - page 11 / 59
» A Logic for Variable Aliasing in Logic Programs
Sort
View
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 2 months ago
Temporal Probabilistic Logic Programs: State and Revision
There are numerous applications where we have to deal with temporal uncertainty associated with events. The Temporal Probabilistic (TP) Logic Programs should provide support for v...
Zoran Majkic
FLOPS
2004
Springer
14 years 1 months ago
Set-Sharing Is Not Always Redundant for Pair-Sharing
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
Francisco Bueno, Maria J. García de la Band...
AMAI
1999
Springer
13 years 7 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 7 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
PEPM
2007
ACM
14 years 1 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