A resolution principle for clauses with constraints
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 178-192
- https://doi.org/10.1007/3-540-52885-7_87
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Order-Sorted Equational ComputationPublished by Elsevier ,1989
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Lazy Theory Unification in Prolog: An Extension of the Warren Abstract MachinePublished by Springer Nature ,1986
- The Semantic Clause Graph Procedure — A First OverviewPublished by Springer Nature ,1986
- An Overview of the KL‐ONE Knowledge Representation System*Cognitive Science, 1985
- Automated deduction by theory resolutionJournal of Automated Reasoning, 1985
- Equality, types, modules, and (why not?) generics for logic programmingThe Journal of Logic Programming, 1984
- Paramodulation and set of supportPublished by Springer Nature ,1970
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- Untersuchungen zur mehrsortigen QuantorenlogikMathematische Annalen, 1962