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

A relational approach to logic programming: The extended Alexander method

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

DOI10.1016/0304-3975(89)90089-3zbMath0687.68003OpenAlexW2026267935MaRDI QIDQ1263276

Jean-Marc Kerisit

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90089-3

zbMATH Keywords

completenessterminationsoundnessalgorithm of the Alexander transformationcompiling method for logic programs without negation


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Theory of software (68N99)


Related Items

Recursive query processing: The power of logic



Cites Work

  • The Alexander Method - a technique for the processing of recursive axioms in deductive databases
  • Implementation of logical query languages for databases
  • On compiling queries in recursive first-order databases
  • Contributions to the Theory of Logic Programming
  • The Semantics of Predicate Logic as a Programming Language
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1263276&oldid=13358807"
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 10:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki