SICStus

swMATH12440MaRDI QIDQ24368FDOQ24368

Author name not available (Why is that?)

Cited In (91)

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

This page was built for software: SICStus