Abstract
Declarative rule-based systems can be generalized to constraint-based systems. However, although conventional constraint systems require that the set of parameters which exist in a problem be known ab initio,there are some applications in which the existence of certain parameters is dependent on conditions whose truth or falsity can only be determined dynamically. In this paper, we show how this conditional existence of parameters 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 to a range of applications, a constraint language in which any sentence in full first-order free logic, about a many-sorted universe of discourse which subsumes the real numbers, is a well-formed constraint.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bowen J, and Bahler D, 1990, “Improving Ontological Expressiveness in Constraint Processing,” Technical Report, Department of Computer Science, North Carolina State University.
Bowen J, and Bahler D, 1991, “Free Logic in Constraint Processing,” Technical Report, Department of Computer Science, North Carolina State University. Submitted to Artificial Intelligence journal.
Bowen J, and Bahler D, 1991, “Conditional Existence of Variables in Generalized Constraint Networks,” in Proceedings of AAA I-91, the National Conference of the American Association for Artificial Intelligence, Anaheim CA, July 1991.
Bowen J, O’Grady P and Smith L, 1990, “A Constraint Programming Language for Life-Cycle Engineering,” International Journal for Artificial Intelligence in Engineering, 5 (4), 206–220.
Bowen J, and Bahler D, 1992, “Compound Constraint Propagation,” Technical Report, Department of Computer Science, North Carolina State University.
Bowen J, Bahler D, and Dholakia A, 1990, “A DFT Advisor for Digital Circuit Design,” Technical Report, Department of Computer Science, North Carolina State University. To appear in Computers and Electrical Engineering, special issue on Artificial Intelligence in Engineering Design and Manufacturing.
Friedman G and Leondes C, 1969, “Constraint Theory, Part I: Fundamentals,” IEEE Transactions on Systems Science and Cybernetics, ssc-5, 1, 48–56.
Hirst G, 1989, “Ontological assumptions in knowledge representation,” Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, 157–169.
Lambert K and van Fraassen B, 1972, Derivation and Counterexample: An Introduction to Philosophical Logic, Enrico, CA: Dickenson Publishing Company.
Mackworth A, 1987. “Constraint Satisfaction,” in S. Shapiro (ed.), The Encyclopedia of Artificial Intelligence, New York: Wiley, 205–211.
Mittal S and Falkenhainer B, 1990, “Dynamic Constraint Satisfaction Problems,” Proceedings of the Eighth National Conference on Artificial Intelligence, 25–32.
Mulder J, Mackworth A and Havens W, 1988, “Knowledge Structuring and Constraint Satisfaction: The Mapsee Approach,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 10 (6), 866–879.
Nilsson N, 1991, “Logic and Artificial Intelligence,” Artificial Intelligence, 47, 31–56.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bowen, J., Bahler, D. (1993). Generalized Knowledge Representation using Free Logic. In: Sorensen, H. (eds) AI and Cognitive Science ’91. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3562-3_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3562-3_16
Publisher Name: Springer, London
Print ISBN: 978-3-540-19785-0
Online ISBN: 978-1-4471-3562-3
eBook Packages: Springer Book Archive