The following pages link to (Q3340205):
Displayed 42 items.
- A time bound on the materialization of some recursively defined views (Q578941) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- Extended database logic: Complex objects and deduction (Q918674) (← links)
- A knowledge-based system for performance optimization of a relational database system (Q918738) (← links)
- Closed world assumptions having precedence in predicates (Q922726) (← links)
- Conceptual and ontological modeling in information systems (Q1040330) (← links)
- Domain-independent formulas and databases (Q1092679) (← links)
- Subsumption and implication (Q1094152) (← links)
- Multi-layer logic - a predicate logic including data structure as knowledge representation language (Q1097720) (← links)
- On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168) (← links)
- Partial evaluation of queries in deductive databases (Q1108821) (← links)
- An algorithm to compute circumscription (Q1115208) (← links)
- Minimalism, justification and non-monotonicity in deductive databases (Q1123011) (← links)
- A deductive database on Aristotelian logic (Q1123023) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- Unique complements and decompositions of database schemata (Q1318468) (← links)
- Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
- Automated theorem proving in temporal logic: \(T\)-resolution (Q1322389) (← links)
- An efficient database transitive closure algorithm (Q1330412) (← links)
- Intuitionistic interpretation of deductive databases with incomplete information (Q1341709) (← links)
- Characterization of desirable properties of general database decompositions. (Q1353960) (← links)
- Incomplete deductive databases (Q1360679) (← links)
- Active integrity constraints for general-purpose knowledge bases (Q1783734) (← links)
- Translation of logic programs into functional fixpoint equations (Q1823723) (← links)
- Fixpoint strategies for deductive databases (Q1823737) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Jack Minker --- A profile (Q1924718) (← links)
- Data summarization in relational databases through fuzzy dependencies (Q1971769) (← links)
- Beyond graph neural networks with lifted relational neural networks (Q2071316) (← links)
- A deductive database approach for complex objects (Q2277840) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- Type data bases with incomplete information (Q2638764) (← links)
- Answering atomic queries in indefinite deductive databases (Q3486861) (← links)
- A note on fixpoint techniques in data base recursive logic programs (Q3792286) (← links)
- Operation management in object-oriented knowledge bases (Q3814789) (← links)
- Recursive query processing in predicate-goal graph (Q5096200) (← links)
- Semantics and expressive power of nondeterministic constructs in deductive databases (Q5943120) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- Paraconsistent logic and query answering in inconsistent databases (Q6117329) (← links)
- A graph-based decomposition approach for recursive query processing (Q6199460) (← links)