Redundant modeling for the quasigroup completion problem

DOI10.1007/B13743MaRDI QIDQ5897203zbMATH OpenOpenAlexFDO

Authors Ivan Dotu, Alvaro del Val, Manuel Cebrian

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Loops, quasigroups (20N05) General topics of discrete mathematics in relation to computer science (68R01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Recent Advances in Constraints
• Redundant modeling in permutation weighted constraint satisfaction problems
• Removing propagation redundant constraints in redundant modeling
• Solving quantified constraint satisfaction problems
• Increasing constraint propagation by redundant modeling: An experience report

Cited in

(3)

• Automatic generation of redundant models for permutation constraint satisfaction problems
• On the Integration of Singleton Consistencies and Look-Ahead Heuristics
• Redundant modeling in permutation weighted constraint satisfaction problems

Describes a project that uses

Uses Software

• CPlan

This page was built for publication: Redundant modeling for the quasigroup completion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897203)