The following pages link to Jerzy Marcinkowski (Q314824):
Displayed 30 items.
- Converging to the chase -- a tool for finite controllability (Q314825) (← links)
- Prioritized repairing and consistent query answering in relational databases (Q454141) (← links)
- Disjunctive databases for representing repairs (Q987484) (← links)
- The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable. (Q1400708) (← links)
- Minimal-change integrity maintenance using tuple deletions (Q1776402) (← links)
- Thue trees (Q1861534) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- (Q2762516) (← links)
- B and D Are Enough to Make the Halpern–Shoham Logic Undecidable (Q3587452) (← links)
- On the Expressive Power of Graph Logic (Q3613359) (← links)
- (Q4230359) (← links)
- Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs (Q4268878) (← links)
- (Q4349804) (← links)
- (Q4411828) (← links)
- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950) (← links)
- Undecidability of the first order theory of one-step right ground rewriting (Q4594232) (← links)
- The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable (Q4635811) (← links)
- (Q4938599) (← links)
- (Q4938642) (← links)
- (Q4945236) (← links)
- (Q5091128) (← links)
- Can One Escape Red Chains? (Q5145324) (← links)
- All–Instances Termination of Chase is Undecidable (Q5167846) (← links)
- Converging to the Chase -- A Tool for Finite Controllability (Q5271092) (← links)
- The Undecidability of the Logic of Subintervals (Q5415296) (← links)
- Inconsistency Tolerance (Q5464029) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705918) (← links)
- (Q5874355) (← links)
- Uniform Restricted Chase Termination (Q6156026) (← links)