Sciweavers

977 search results - page 78 / 196
» Logic programming with infinite sets
Sort
View
98
Voted
ICLP
2004
Springer
15 years 5 months ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
93
Voted
WEBI
2007
Springer
15 years 6 months ago
Logic Programming to Address Issues of the Semantic Web
The size of the Web and its increase rate made it cumbersome to locate high precision results to a requested piece of information. The Semantic Web provides a framework and a set ...
Isambo Karali
118
Voted
ASP
2003
Springer
15 years 5 months ago
Parametric Connectives in Disjunctive Logic Programming
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
Nicola Leone, Simona Perri
95
Voted
IJCAI
2003
15 years 1 months ago
Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...
ENTCS
2007
190views more  ENTCS 2007»
15 years 2 days ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...