Conditional existence of variables in generalized constraint networks (1991) [12 citations — 4 self]
Abstract:
Classical constraint systems require that the set of variables which exist in a problem be known ab initio. However, there are some applications in which the existence of certain variables is dependent on conditions whose truth or falsity can only be determined dynamically. In this paper, we show how this conditional existence of variables can be handled in a mathematically well-founded fashion by viewing a constraint network as a set of sentences in free logic. Based on these ideas, we have developed, implemented and applied, a constraint language in which any sentence in full first-order free logic, about a many-sorted universe of discourse which subsumes ℜ, is a well-formed constraint. 1
Citations
| 243 | Constraint Satisfaction – Mackworth - 1987 |
| 51 | Ontological assumptions in knowledge representation – Hirst - 1989 |
| 20 | Knowledge Structuring and Constraint Satisfaction: The Mapsee Approach – Mulder, Mackworth, et al. - 1988 |
| 14 | A constraint programming language for life-cycle engineering – Bowen, O’Grady, et al. - 1990 |
| 8 | Dynamic constraint satisfaction – Mittal, Falkenhainer - 1990 |
| 4 | Constraint Theory, Part I: Fundamentals – Friedman, Leondes - 1969 |
| 4 | Derivation and Counterexample: An Introduction to Philosophical Logic – Lambert, Fraassen - 1972 |
| 3 | A DFT Advisor for Digital Circuit Design,” AutoTestCon ’91 – Dholakia, “RICK - 1991 |
| 1 | Improving Ontological Expressiveness in Constraint Processing – Bowen, Bahler - 1990 |
| 1 | Compound Propagation: A Constraint Monitoring Algorithm – Bowen, Bahler, et al. - 1991 |

