Search Sciweavers | Sciweavers

Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...

Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...

claim paper

Read More »

116

click to vote

CP
2005
Springer

79views Artificial Intelligence» more CP 2005»

Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains

15 years 10 months ago

Download www.mff.cuni.cz

Josef Zlomek, Roman Barták

claim paper

Read More »

141

click to vote

EUSFLAT
2009

124views Fuzzy Logic» more EUSFLAT 2009»

A Semi-infinite Programming Approach to Possibilistic Optimization under Necessity Measure Constraints

15 years 2 months ago

Download www.eusflat.org

Masahiro Inuiguchi

claim paper

Read More »

163

Voted

PPCP
1993

148views Programming Languages» more PPCP 1993»

Higher-Order Logic Programming as Constraint Logic Programming

15 years 8 months ago

Download www.cs.cmu.edu

Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...

Spiro Michaylov, Frank Pfenning

claim paper

Read More »

« Prev « First page 2 / 122 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers