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

Circumscription and implicit definability

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

DOI10.1007/BF00244277zbMath0614.68070OpenAlexW2032362523MaRDI QIDQ1819950

Jon Doyle

Publication date: 1985

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00244277


zbMATH Keywords

artificial intelligencenon-monotonic reasoningcircumscriptionBeth's theoremimplicit definition


Mathematics Subject Classification ID

Artificial intelligence (68T99)


Related Items

Closed-world databases and circumscription ⋮ The importance of open and recursive circumscription ⋮ Definability and commonsense reasoning ⋮ Using approximate reasoning to represent default knowledge ⋮ Completeness results for circumscription



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1819950&oldid=14181110"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki