Sciweavers

322 search results - page 14 / 65
» Combinations of Abstract Domains for Logic Programming
Sort
View
124
Voted
CP
2005
Springer
15 years 9 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
114
Voted
CP
2008
Springer
15 years 5 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
132
Voted
CORR
2000
Springer
144views Education» more  CORR 2000»
15 years 3 months ago
Sequence-Based Abstract Interpretation of Prolog
-BASED ABSTRACT INTERPRETATION OF PROLOG1 BAUDOUIN LE CHARLIER, SABINA ROSSI, AND PASCAL VAN HENTENRYCK . Abstract interpretation is a general methodology for systematic developmen...
Baudouin Le Charlier, Sabina Rossi, Pascal Van Hen...
152
Voted
CLIMA
2006
15 years 5 months ago
An Argumentation-Based Negotiation for Distributed Extended Logic Programs
Abstract. The paradigm of argumentation has been used in the literature to assign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules...
Iara Carnevale de Almeida, José Júli...
121
Voted
CCIA
2005
Springer
15 years 9 months ago
On Warranted Inference in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
Carlos Iván Chesñevar, Guillermo Ric...