scientific article; zbMATH DE number 4199653
From MaRDI portal
Publication:3348435
zbMATH Open0726.68064MaRDI QIDQ3348435FDOQ3348435
Author name not available (Why is that?)
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
Cited In (35)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient and Scalable Induction of Logic Programs Using a Deductive Database System
- Constructing interpretations of deductive databases using reduction and dynamic stratification
- The defining power of stratified and hierarchical logic programs
- Title not available (Why is that?)
- On Well-Founded Set-Inductions and Locally Monotone Operators
- On reasoning about structural equality in XML: a description logic approach
- Title not available (Why is that?)
- The expressive powers of the logic programming semantics
- Stratification and knowledge base management
- Title not available (Why is that?)
- Temporal stratification tests for linear and branching-time deductive databases
- Title not available (Why is that?)
- Logic Programming Languages for Databases and the Web
- Title not available (Why is that?)
- Correct answers to allowed programs and queries are ground
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incorporating stratified negation into query-subquery nets for evaluating queries to stratified deductive databases
- Mixed integer programming methods for computing nonmonotonic deductive databases
- Negation in rule-based database languages: A survey
- Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
- Verifying local stratifiability of logic programs and databases
- COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES
- The well-founded semantics for general logic programs
- On the relationship between annotated logic programs and nonmonotonic formalisms
- Title not available (Why is that?)
- A semantics for a class of stratified production system programs
- Stratified negation in temporal logic programming and the cycle-sum test
- Reachability is harder for directed than for undirected finite graphs
- Update rules in datalog programs
- Evaluation of queries under closed-world assumption. II: The hierarchical case
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
- Negation by default and unstratifiable logic programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348435)
