scientific article; zbMATH DE number 1312992
From MaRDI portal
Publication:4254883
zbMath0935.68098MaRDI QIDQ4254883
Peter J. Stuckey, Kim Marriott
Publication date: 1 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Related Items (58)
Graph Transduction as a Noncooperative Game ⋮ Querying incomplete information in RDF with SPARQL ⋮ ECLiPSe – From LP to CLP ⋮ Filtering algorithms for the multiset ordering constraint ⋮ Logic programming with solution preferences ⋮ Certificate size reduction in abstraction-carrying code ⋮ Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming ⋮ Automatic Minimal-Height Table Layout ⋮ Solving nesting problems with non-convex polygons by constraint logic programming ⋮ Scheduling and routing of automated guided vehicles: A hybrid approach ⋮ Tiling algebra for constraint-based layout editing ⋮ A new generic scheme for functional logic programming with constraints ⋮ Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO ⋮ Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming ⋮ Fifty Years of Prolog and Beyond ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Orbitopal fixing ⋮ Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section ⋮ Semiring-Based Soft Constraints ⋮ TCHR: a framework for tabled CLP ⋮ Integrated production and material handling scheduling using mathematical programming and constraint programming ⋮ Solving RCPSP/max by lazy clause generation ⋮ Placement Inference for a Client-Server Calculus ⋮ Propagation = Lazy Clause Generation ⋮ Memetic algorithm timetabling for non-commercial sport leagues. ⋮ A survey of constraint-based programming paradigms ⋮ A unified theory of structural tractability for constraint satisfaction problems ⋮ Unnamed Item ⋮ atalog: A logic language for expressing search and optimization problems ⋮ An analysis of arithmetic constraints on integer intervals ⋮ Automatic generation of redundant models for permutation constraint satisfaction problems ⋮ Towards constraint-based school timetabling ⋮ Automatic Proofs of Termination With Elementary Interpretations ⋮ Lazy Constraint Imposing for Improving the Path Constraint ⋮ A hybrid differential evolution algorithm with column generation for resource constrained job scheduling ⋮ New model and heuristics for safety stock placement in general acyclic supply chain networks ⋮ Linear Structures for Concurrency in Probabilistic Programming Languages ⋮ On the Number of Rule Applications in Constraint Programs ⋮ Recognizing frozen variables in constraint satisfaction problems ⋮ Propagation via lazy clause generation ⋮ Recurrence with affine level mappings is P-time decidable for CLP ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ Description, Implementation, and Evaluation of a Generic Design for Tabled CLP ⋮ Incremental and Modular Context-sensitive Analysis ⋮ Partially distributed outer approximation ⋮ Three perspectives for solving the job grouping problem ⋮ Optimal placement of valves in a water distribution network with CLP(FD) ⋮ Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes ⋮ Integrating answer set programming and constraint logic programming ⋮ Monadic constraint programming ⋮ Selective Unification in (Constraint) Logic Programming* ⋮ Local consistency for extended CSPs ⋮ Wombit: a portfolio bit-vector solver using word-level propagation ⋮ A new branch-and-filter exact algorithm for binary constraint satisfaction problems ⋮ Detection of the discrete convexity of polyominoes ⋮ Mixed global constraints and inference in hybrid CLP--IP solvers ⋮ Backjump-based backtracking for constraint satisfaction problems ⋮ An algorithm-independent measure of progress for linear constraint propagation
This page was built for publication:
