The following pages link to (Q4864249):
Displaying 50 items.
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus (Q1706163) (← links)
- Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Matching dependencies: semantics and query answering (Q1762196) (← links)
- A complete axiomatization of fuzzy functional dependencies using fuzzy function (Q1770793) (← links)
- Minimal-change integrity maintenance using tuple deletions (Q1776402) (← links)
- On the complexity of deciding typability in the relational algebra (Q1777227) (← links)
- Active integrity constraints for general-purpose knowledge bases (Q1783734) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Functional queries in datalog (Q1862647) (← links)
- On the decidability of the termination problem of active database systems (Q1884939) (← links)
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning (Q1928818) (← links)
- From orthogonal projections to a generalized quantum search (Q1937233) (← links)
- Heterogeneous active agents. III: Polynomially implementable agents (Q1978315) (← links)
- Functional dependency restricted insertion propagation (Q1986557) (← links)
- Semi-oblivious chase termination: the sticky case (Q2035470) (← links)
- Consistent query answering for primary keys in Datalog (Q2035471) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- On the complexity and approximability of repair position selection problem (Q2051902) (← links)
- Situation calculus for controller synthesis in manufacturing systems with first-order state representation (Q2060723) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Fast left Kan extensions using the chase (Q2102935) (← links)
- On sampling representatives of relational schemas with a functional dependency (Q2103897) (← links)
- On the expressive power of message-passing neural networks as global feature map transformers (Q2103899) (← links)
- Can you answer while you wait? (Q2103911) (← links)
- Optimizing multiset relational algebra queries using weak-equivalent rewrite rules (Q2103917) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- The delay and window size problems in rule-based stream reasoning (Q2124457) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- Modular materialisation of Datalog programs (Q2144176) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Inference-proof updating of a weakened view under the modification of input parameters (Q2167727) (← links)
- Counting subset repairs with functional dependencies (Q2221807) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Characterizing functional dependencies in formal concept analysis with pattern structures (Q2254619) (← links)
- Constructing Armstrong tables for general cardinality constraints and not-null constraints (Q2254637) (← links)
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638) (← links)
- Functional dependencies on extended relations defined by regular languages (Q2254640) (← links)
- Functional dependencies are helpful for partial materialization of data cubes (Q2254643) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Distance-based paraconsistent logics (Q2270429) (← links)
