Corpus ID: 17706353

Combinatorial Search With Picat

@article{Zhou2014CombinatorialSW,
  title={Combinatorial Search With Picat},
  author={Neng-Fa Zhou},
  journal={ArXiv},
  year={2014},
  volume={abs/1405.2538}
}
  • Neng-Fa Zhou
  • Published 2014
  • Computer Science
  • ArXiv
  • Picat, a new member of the logic programming family, follows a different doctrine than Prolog in offering the core logic programming concepts: arrays and maps as built-in data types; implicit pattern matching with explicit unification and explicit non-determinism; functions for deterministic computations; and loops for convenient scripting and modeling purposes. Picat provides facilities for solving combinatorial search problems, including a common interface with CP, SAT, and MIP solvers… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    Programming in Picat

    Constraint Solving and Planning with Picat

    Planning as Tabled Logic Programming

    The effect of domain modeling on efficiency of planning: Lessons from the Nomystery domain

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    The Effect of Domain Modeling on Performance of Planning Algorithms

    • Roman Barták, Jindřich Vodrážka
    • 2015

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 44 REFERENCES

    Constraint and Integer Programming in OPL

    VIEW 2 EXCERPTS

    Planning as satisfiability: Heuristics

    VIEW 2 EXCERPTS

    Linear tabling strategies and optimizations

    VIEW 5 EXCERPTS

    Handbook of Constraint Programming

    My first look at picat as a modeling language for constraint solving and planning

    • Håkan Kjellerstrand
    • Computer Science
    • The 26th Chinese Control and Decision Conference (2014 CCDC)
    • 2014
    VIEW 1 EXCERPT

    Logic for problem solving

    VIEW 1 EXCERPT

    Memoing for logic programs

    VIEW 1 EXCERPT

    Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut

    VIEW 1 EXCERPT