Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
66,635
Constraint lingo: A program for solving logic puzzles and other tabular constraint problems
- Logics in Artificial Intelligence, volume 2424 of Lecture Notes in Computer Science. Berlin
"... Constraint Lingo is a high-level language for specifying and solving tabular con-straint problems [FMT01]. We show the syntax of this language through ex-amples. Our software translates Constraint Lingo programs into a variety of ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Constraint Lingo is a high-level language for specifying and solving tabular con-straint problems [FMT01]. We show the syntax of this language through ex-amples. Our software translates Constraint Lingo programs into a variety of
Constraint Networks
, 1992
"... Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract
-
Cited by 1149 (43 self)
- Add to MetaCart
expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth maintenance, scheduling, spatiotemporal reasoning, logic programming and user interface. Constraint networks are graphical representations used to guide strategies for solving constraint satisfaction problems
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract
-
Cited by 616 (76 self)
- Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of mu ..."
Abstract
-
Cited by 459 (36 self)
- Add to MetaCart
property, confluence, of CHR programs and define a tight integration of CHR with constraint logic programming languages. This survey then describes implementations of the language before we review several constraint solvers - both traditional and non- standard ones - written in the CHR language. Finally we
Prosodic Morphology: constraint interaction and satisfaction
, 1993
"... Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other non-commercial purpose. Table of Contents Acknowledgments......................................................... ..."
Abstract
-
Cited by 420 (31 self)
- Add to MetaCart
Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other non-commercial purpose. Table of Contents Acknowledgments.........................................................
Relative Income, Happiness and Utility: An Explanation for the Easterlin Paradox and Other Puzzles
, 2007
"... ..."
Constraint Lingo: Towards high-level constraint programming
, 2002
"... Logic programming can be difficult and error-prone because logic-programming formalisms are too low-level to be used without great effort. Instead, people should program with higher-level constructs, and those programs should then be automatically compiled into ecient and correct low-level logic for ..."
Abstract
-
Cited by 11 (2 self)
- Add to MetaCart
Logic programming can be difficult and error-prone because logic-programming formalisms are too low-level to be used without great effort. Instead, people should program with higher-level constructs, and those programs should then be automatically compiled into ecient and correct low-level logic
Tabular constraint-satisfaction problems and answer-set programming
- AAAI-2001 Spring Symposium Series, Workshop on Answer Set Programming
, 2001
"... We argue that database query languages can be used to spec-if’y constraint satisfaction problems. We describe one such language here. It is based on tuple relational calculus and its sentences are used to define constraints. For a fragment of this language we develop a front end, Constraint Lingo, t ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
We argue that database query languages can be used to spec-if’y constraint satisfaction problems. We describe one such language here. It is based on tuple relational calculus and its sentences are used to define constraints. For a fragment of this language we develop a front end, Constraint Lingo
Results 1 - 10
of
66,635
