SICStus

swMATH12440MaRDI QIDQ24368

No author found.

Related Items (91)

Using finite transducers for describing and synthesising structural time-series constraints ⋮ Pair-sharing over rational trees ⋮ Distributed programming with logic tuple spaces ⋮ Making ProB Compatible with SWI-Prolog ⋮ The YAP Prolog system ⋮ SICStus Prolog—The first 25 years ⋮ The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines ⋮ Filtering algorithms for the multiset ordering constraint ⋮ A design and implementation of the Extended Andorra Model ⋮ Integrating formal specifications into applications: the ProB Java API ⋮ Reformulation of global constraints based on constraints checkers ⋮ Applying ad-hoc global constraints with the case constraint to still-life ⋮ Probabilistic abductive logic programming using Dirichlet priors ⋮ Solving nesting problems with non-convex polygons by constraint logic programming ⋮ Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ⋮ Graph matching problems and the NP-hardness of sortedness constraints ⋮ Running programs backwards: The logical inversion of imperative computation ⋮ Constraint solving for interpolation ⋮ Philosophy of the MiniZinc challenge ⋮ Temporal resolution using a breadth-first search algorithm ⋮ A new generic scheme for functional logic programming with constraints ⋮ Controlling the complexity in model-based diagnosis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Concolic testing in logic programming ⋮ Description and Optimization of Abstract Machines in a Dialect of Prolog ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Solving distributed constraint optimization problems using logic programming ⋮ Logic + control: On program construction and verification ⋮ Unnamed Item ⋮ Two loop detection mechanisms: A comparison ⋮ The execution algorithm of mercury, an efficient purely declarative logic programming language ⋮ Experience with the Super Monaco optimizing compiler ⋮ Detection and optimization of suspension-free logic programs ⋮ Graph Invariants as Necessary Conditions for Global Constraints ⋮ \textsc{Tor}: modular search with hookable disjunction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new constraint programming approach for the orthogonal packing problem ⋮ Propagation algorithms for lexicographic ordering constraints ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ Search combinators ⋮ Automatic generation of redundant models for permutation constraint satisfaction problems ⋮ Maxx: Test pattern optimisation with local search over an extended logic ⋮ Modeling biological systems in stochastic concurrent constraint programming ⋮ Directional types and the annotation method ⋮ Unnamed Item ⋮ Towards constraint-based school timetabling ⋮ An Optimal Strategy for the Constrained Cycle Cover Problem ⋮ Blackboard relations in the \(\mu\text{Log}\) coordination model ⋮ Performance of Muse on switch-based multiprocessor machines ⋮ Optimization schemas for parallel implementation of non‐deterministic languages and systems ⋮ Unnamed Item ⋮ Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations ⋮ An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints ⋮ Sweep synchronization as a global propagation mechanism ⋮ A constraint programming approach to cutset problems ⋮ Unnamed Item ⋮ On applying or-parallelism and tabling to logic programs ⋮ From Rules to Constraint Programs with the Rules2CP Modelling Language ⋮ Removing irrelevant information in temporal resolution proofs ⋮ The Boolean Constraint Solver of SWI-Prolog (System Description) ⋮ Backjumping is Exception Handling ⋮ Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules ⋮ Test Data Generation of Bytecode by CLP Partial Evaluation ⋮ Integrating induction and abduction in logic programming ⋮ A semantics for modular general logic programs ⋮ Integrating answer set programming and constraint logic programming ⋮ Integrating Finite Domain and Set Constraints into a Set-based Constraint Language ⋮ An efficient relational deductive system for propositional non-classical logics ⋮ Principles and Practice of Constraint Programming – CP 2004 ⋮ Unnamed Item ⋮ Implementing type theory in higher order constraint logic programming ⋮ Non-strict independence-based program parallelization using sharing and freeness information ⋮ Intelligent data retrieval in prolog: An illuminating idea ⋮ Linear relaxations and reduced-Cost based propagation of continuous variable subscripts ⋮ View-based propagator derivation ⋮ On matrices, automata, and double counting in constraint programming ⋮ Synchronized sweep algorithms for scalable scheduling constraints ⋮ A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems ⋮ Mixtus: An automatic partial evaluator for full Prolog ⋮ A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming ⋮ Programming constraint services. High-level programming of standard and new constraint services ⋮ Scheduling speculative work in MUSE and performance results ⋮ Finite-tree analysis for constraint logic-based languages

This page was built for software: SICStus