scientific article; zbMATH DE number 4199654
From MaRDI portal
Publication:3348436
zbMATH Open0726.68065MaRDI QIDQ3348436FDOQ3348436
Authors: Allen Van Gelder 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
Cited In (40)
- The expressive power of stratified logic programs
- A transformation system for deductive database modules with perfect model semantics
- Circumscriptive theories: A logic-based framework for knowledge representation
- Programming in three-valued logic
- A comparison between algebraic query languages for flat and nested databases
- General logical databases and programs: Default logic semantics and stratification
- Why not negation by fixpoint?
- Graph properties for normal logic programs
- Twelve Definitions of a Stable Model
- To Vladimir Lifschitz on His 65th Birthday
- Stratified resolution
- Formalizing a logic for logic programming
- A nondeterministic well-founded semantics
- A three-valued semantics for deductive databases and logic programs
- Stratification and knowledge base management
- An analysis of loop checking mechanisms for logic programs
- Datalog extensions for database queries and updates
- On the expressive power of database queries with intermediate types
- On the computational cost of disjunctive logic programming: Propositional case
- Parallel complexity of logical query programs
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- Complexity and undecidability results for logic programming
- An algorithm to compute circumscription
- Magic sets for disjunctive Datalog programs
- Jack Minker --- A profile
- Description logics of minimal knowledge and negation as failure
- On the relationship between circumscription and negation as failure
- Stratified least fixpoint logic
- Defeasible logic versus Logic Programming without Negation as Failure
- General failure of logic programs
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Negation as failure using tight derivations for general logic programs
- Negation in rule-based database languages: A survey
- Indefinite abductive explanations
- Thirteen Definitions of a Stable Model
- Loop checking in SLD-derivations by well-quasi-ordering of goals
- Bottom-up evaluation and query optimization of well-founded models
- A logic for programming with complex objects
- Tight logic programs
- 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 Q3348436)
