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 complexity of revising logic programs

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

DOI10.1016/S0743-1066(99)00021-7zbMath0937.68024MaRDI QIDQ4262832

Russell Greiner

Publication date: 24 February 2000

Published in: The Journal of Logic Programming (Search for Journal in Brave)


zbMATH Keywords

inductive logic programmingrule-based program


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)


Related Items (2)

The complexity of theory revision ⋮ Theory revision with queries: Horn, read-once, and parity formulas




This page was built for publication: The complexity of revising logic programs

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