swMATH12440MaRDI QIDQ24368FDOQ24368
Author name not available (Why is that?)
Official website: https://sicstus.sics.se/
Cited In (only showing first 100 items - show all)
- Mixtus: An automatic partial evaluator for full Prolog
- Using finite transducers for describing and synthesising structural time-series constraints
- The YAP prolog system
- Sweep synchronization as a global propagation mechanism
- Reformulation of global constraints based on constraints checkers
- Modeling biological systems in stochastic concurrent constraint programming
- 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
- Integrating answer set programming and constraint logic programming
- Constraint solving for interpolation
- 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
- Representing constraint satisfaction problems in answer set programming
- DLV-EX
- Smodels
- Mozart
- WSAT(OIP)
- Choco
- FlatZinc
- Gecode
- clpfd
- JaCoP
- Rules2CP
- Prolog
- wamcc
- Oz
- B-Prolog
- Cardinal
- ProB
- YAP-Prolog
- Hiord
- From Rules to Constraint Programs with the Rules2CP Modelling Language
- ARA
- Mercury
- CaSPER
- SLIDE
- RALL
- Zinc
- Janus
- Linda
- Lucinda
- Cellerator
- Ciao
- CiaoPP
- fzn2smt
- NP Datalog
- CAT
- OPTYap
- FOOL
- XSB
- YapOr
- YapTab
- CLPGUI
- Graph Invariants as Necessary Conditions for Global Constraints
- GHC
- CFLP
- clpb
- STeP
- cc(FD)
- OPL
- SWI-Prolog
- HiPE
- PARLOG
- ezcsp
- LPaaS
- JSetL
- FaCiLe
- HIBISCUS
- SWISH DataLab
- Title not available (Why is that?)
- Solving constraint satisfaction problems with SAT modulo theories
- Title not available (Why is that?)
- Philosophy of the MiniZinc challenge
- redpl.pl
- SenticNet
- 2P-Kt
- ReSpecT
- tuProlog
- TuCSoN
- TuSoW
- An efficient relational deductive system for propositional non-classical logics
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Search combinators
- Pair-sharing over rational trees
- Towards constraint-based school timetabling
- Synchronized sweep algorithms for scalable scheduling constraints
- 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
- Finite-tree analysis for constraint logic-based languages
- Programming constraint services. High-level programming of standard and new constraint services
- Removing irrelevant information in temporal resolution proofs
- Backjumping is Exception Handling
- Title not available (Why is that?)
- Operational semantics for reexecution-based analysis of logic programs with delay declarations
- Title not available (Why is that?)
- Description and optimization of abstract machines in a dialect of Prolog
- Title not available (Why is that?)
This page was built for software: SICStus
