Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The occur-check problem in Prolog

From MaRDI portal
Publication:1077912
Jump to:navigation, search

DOI10.1007/BF03037324zbMath0595.68007MaRDI QIDQ1077912

David Alan Plaisted

Publication date: 1984

Published in: New Generation Computing (Search for Journal in Brave)


zbMATH Keywords

unificationlogic programmingoccur checkfirst-order predicate calculusoperatinal semanticsProlog programs


Mathematics Subject Classification ID

General topics in the theory of software (68N01)


Related Items

Automatic inductive theorem proving using Prolog, A relaxed condition for avoiding the occur-check, Semantics for logic programs without occur check, Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities, C-expressions: A variable-free calculus for equational logic programming, Compiling a default reasoning system into Prolog, Set-sharing is redundant for pair-sharing



Cites Work

  • A Machine-Oriented Logic Based on the Resolution Principle
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1077912&oldid=13096565"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki