The following pages link to Querying logical databases (Q579967):
Displaying 11 items.
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Towards an algebraic theory of information integration (Q703841) (← links)
- On the representation and querying of sets of possible worlds (Q1174717) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Intuitionistic interpretation of deductive databases with incomplete information (Q1341709) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- Incomplete deductive databases (Q1360679) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- Simulating Dynamic Systems Using Linear Time Calculus Theories (Q2931258) (← links)
