Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Solving large combinatorial problems in logic programming
Journal of Logic Programming - Logic programming applications
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Parameter passing and control stack management in Prolog implementation revisited
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fast algorithm for the bound consistency of alldiff constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A high-level intermediate language and the algorithms for compiling finite-domain constraints
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Metastructures versus Attributed Variables in the Context of Extensible Unification
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Implementing Constrant Solvers in B-Prolog
Proceedings of the IFIP 17th World Computer Congress - TC12 Stream on Intelligent Information Processing
Compiling Constraint Handling Rules into Prolog with Attributed Variables
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Constraint Processing
Optimizing compilation of constraint handling rules in HAL
Theory and Practice of Logic Programming
Programming constraint services: high-level programming of standard and new constraint services
Programming constraint services: high-level programming of standard and new constraint services
Efficient constraint propagation engines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Two WAM Implementations of Action Rules
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A 25-year perspective on logic programming
Compiling answer set programs into event-driven action rules
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Reactive imperative programming with dataflow constraints
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
The language features and architecture of b-prolog
Theory and Practice of Logic Programming - Prolog Systems
The finite domain constraint solver of SWI-Prolog
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Towards solver-independent propagators
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
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.