Sciweavers

232 search results - page 15 / 47
» Implementing logical connectives in constraint programming
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Compiler Analysis to Support Compiled Communication for HPF-Like Programs
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
Xin Yuan, Rajiv Gupta, Rami G. Melhem
ICLP
2009
Springer
14 years 8 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
ICLP
2005
Springer
14 years 1 months ago
Towards an Integration of Answer Set and Constraint Solving
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
IBERAMIA
2004
Springer
14 years 26 days ago
Decomposing Ordinal Sums in Neural Multi-adjoint Logic Programs
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
Jesús Medina, Enrique Mérida Caserme...
ICLP
1997
Springer
13 years 11 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...