Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/the-problem-of-naming-and-function-replacement-bhE1pY0Lqp
References (7)
-
R. Overbeek, J. McCharen, L. Wos (1976)
Complexity and related enhancements for automated theorem-proving programsComputers & Mathematics With Applications, 2
-
G. Robinson, L. Wos (1983)
Paramodulation and Theorem-Proving in First-Order Theories with Equality -
L. Wos (1993)
Automated reasoning answers open questions., 5
-
L. Wos (1988)
Automated reasoning: 33 BASIC research problemsJournal of Symbolic Logic, 53
-
G. Robinson, L. Wos (1969)
Machine Intelligence 4 -
L. Wos, Ross Overbeck, E. Lusk, J. Boyle (1984)
Automated Reasoning: Introduction and Applications -
R. Overbeek (1975)
An implementation of hyper-resolutionComputers & Mathematics With Applications, 1
- Publisher
- Springer Journals
- Copyright
- Copyright
- Subject
- Computer Science; Mathematical Logic and Formal Languages; Artificial Intelligence; Mathematical Logic and Foundations; Symbolic and Algebraic Manipulation
- ISSN
- 0168-7433
- eISSN
- 1573-0670
- DOI
- 10.1007/BF00881903
- Publisher site
- See Article on Publisher Site
Abstract
This article is the twenty-eighth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria that an automated reasoning program can profitably use to remove functions present in the representation and replace them with appropriate predicates or constants thatname the entities that werenamed by the functions. The notation used to present a problem to a reasoning program can have a profound effect on the likelihood of the program's success.
Journal
Journal of Automated Reasoning – Springer Journals
Published: Dec 10, 2004