Abstract
Constraint Lingo is a high-level language for specifying and solving tabular constraint problems [FMT01]. We show the syntax of this language through examples. Our software translates Constraint Lingo programs into a variety of back-end logic formalisms, including smodels [NS00], dlv [ELM+98], ECLiPSe [WNS97] and aspps [ET01]. The associated logic engine then generates a set of answers, each of which our software converts to a human-readable table. © 2002 Springer-Verlag.
Cite
CITATION STYLE
Finkel, R., Marek, V. W., & Truszczyński, M. (2002). Constraint Lingo: A program for solving logic puzzles and other tabular constraint problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2424 LNAI, pp. 513–516). Springer Verlag. https://doi.org/10.1007/3-540-45757-7_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
