FIDO: Exploring finite domain consistency techniques in logic programming

2005 ◽  
pp. 425-427
Author(s):  
Manfred Meyer ◽  
Jörg Müller ◽  
Stefan Schrödl
Keyword(s):  
Logic Programming ◽  
Finite Domain ◽  
Domain Consistency

scholarly journals Constraint functional logic programming over finite domains

2007 ◽  
Vol 7 (5) ◽  
pp. 537-582 ◽  
Author(s):  
ANTONIO J. FERNÁNDEZ ◽  
TERESA HORTALÁ-GONZÁLEZ ◽  
FERNANDO SÁENZ-PÉREZ ◽  
RAFAEL DEL VADO-VÍRSEDA
Keyword(s):  
Logic Programming ◽  
Operational Semantics ◽  
Point Of View ◽  
Finite Domain ◽  
Lazy Evaluation ◽  
Functional Logic Programming ◽  
Functional Logic ◽  
Finite Domains ◽  
Higher Order Functions ◽  
Domain Constraints

AbstractIn this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP($\fd$)) with a lazy functional logic programming language which seamlessly embodies finite domain ($\fd$) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP($\fd$)) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe\toy(fd)$, an implementation forCFLP($\fd$), and a comparison of our approach with respect toCLP($\fd$) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existingCLP($\fd$) systems and that clearly outperforms the closer approach toCFLP($\fd$).

Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)

2016 ◽  
Vol 16 (5-6) ◽  
pp. 688-702
Author(s):  
MICHAEL FRANK ◽  
MICHAEL CODISH
Keyword(s):  
Logic Programming ◽  
Software Component ◽  
Constraint Solving ◽  
Finite Domain ◽  
Graph Automorphism ◽  
Sat Solvers ◽  
Ramsey Graphs ◽  
Domain Constraints

AbstractThis paper presents thepl-nautylibrary, a Prolog interface to thenautygraph-automorphism tool. Adding the capabilities ofnautyto Prolog combines the strength of the “generate and prune” approach that is commonly used in logic programming and constraint solving, with the ability to reduce symmetries while reasoning over graph objects. Moreover, it enables the integration ofnautyin existing tool-chains, such as SAT-solvers or finite domain constraints compilers which exist for Prolog. The implementation consists of two components:pl-nauty, an interface connectingnauty's C library with Prolog, andpl-gtools, a Prolog framework integrating the software component ofnauty, calledgtools, with Prolog. The complete tool is available as a SWI-Prolog module. We provide a series of usage examples including two that apply to generate Ramsey graphs.

scholarly journals Programming finite-domain constraint propagators in Action Rules

2006 ◽  
Vol 6 (5) ◽  
pp. 483-507 ◽  
Author(s):  
NENG-FA ZHOU
Keyword(s):  
Logic Programming ◽  
Hybrid Algorithm ◽  
Equality Constraints ◽  
Finite Domain ◽  
Linear Equality Constraints ◽  
Constraint Systems ◽  
Arc Consistency ◽  
Linear Equality ◽  
Execution Model ◽  
Domain Constraints

In this paper, we propose a new language, called AR (Action Rules), and describe how various propagators for finite-domain constraints can be implemented in it. An action rule specifies a pattern for agents, an action that the agents can carry out, and an event pattern for events that can activate the agents. AR combines the goal-oriented execution model of logic programming with the event-driven execution model. This hybrid execution model facilitates programming constraint propagators. A propagator for a constraint is an agent that maintains the consistency of the constraint and is activated by the updates of the domain variables in the constraint. AR has a much stronger descriptive power than indexicals, the language widely used in the current finite-domain constraint systems, and is flexible for implementing not only interval-consistency but also arc-consistency algorithms. As examples, we present a weak arc-consistency propagator for the all_distinct constraint and a hybrid algorithm for n-ary linear equality constraints. B-Prolog has been extended to accommodate action rules. Benchmarking shows that B-Prolog as a CLP(FD) system significantly outperforms other CLP(FD) systems.

Sign in / Sign up

Export Citation Format

Share Document