The following pages link to (Q4301150):
Displaying 17 items.
- Semantics in databases (Q1381077) (← links)
- Epsilon-logic is more expressive than first-order logic over finite structures (Q2710605) (← links)
- On the unusual effectiveness of logic in computer science (Q2736585) (← links)
- Verification, validation, and integrity issues in expert and database systems: Two perspectives (Q2739003) (← links)
- Dependence logic in pregeometries and \(\omega\)-stable theories (Q2805022) (← links)
- Efficient Computation of the Well-Founded Semantics over Big Data (Q2931253) (← links)
- Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
- Towards a characterization of order-invariant queries over tame graphs (Q3616348) (← links)
- (Q3681968) (← links)
- (Q4549420) (← links)
- (Q4875842) (← links)
- Notions of locality and their logical characterizations over finite models (Q4948541) (← links)
- (Q5020560) (← links)
- Successor-invariant first-order logic on finite structures (Q5294027) (← links)
- About yes/no queries against possibilistic databases (Q5297126) (← links)
- Completeness and Herbrand theorems for nominal logic (Q5477637) (← links)
- Semantics in Data and Knowledge Bases (Q5504576) (← links)
