scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
Cited in
(only showing first 100 items - show all)- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- Axiomatizing functional dependencies in the higher-order entity-relationship model
- Modeling virtual worlds in databases
- Safety, domain independence and translation of complex value database queries
- Circumscribing DATALOG: expressive power and complexity
- Expressive power and complexity of partial models for disjunctive deductive databases
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- Sequences, datalog, and transducers
- Algebras for querying text regions: Expressive power and optimization
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Semantics and expressiveness issues in active databases
- The expressive power of stratified logic programs with value invention
- Temporal connectives versus explicit timestamps to query temporal databases
- On the complexity of database queries
- Regular path queries with constraints
- Mathematical fundamentals of database and knowledge base systems
- Finitely representable databases
- A query language for NC
- A first step towards implementing dynamic algebraic dependences
- Models of approximation in databases
- A probabilistic view of Datalog parallelization
- The Kolmogorov expressive power of Boolean query languages
- A corrected 5NF definition for relational database design
- Queries with arithmetical constraints
- Bounded fixpoints for complex objects
- Query containment for data integration systems
- Verification of relational transducers for electronic commerce
- On the content of materialized aggregate views
- Reachability and connectivity queries in constraint databases
- Integrity constraints for XML
- Expressive power of SQL.
- Scalar aggregation in inconsistent databases.
- Algebraic rewritings for optimizing regular path queries.
- On temporal logic versus Datalog
- Incremental recomputation in local languages.
- On the complexity of single-rule datalog queries.
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- On the complexity of equational problems in CNF
- On the impact of regular functional dependencies when moving to a possibilistic database framework.
- Chance discovery in medicine -- detection of rare risky events in chronic diseases
- Games and total Datalog\(^{\lnot}\) queries
- Local properties of query languages
- Path constraints in semistructured databases
- Relational transducers for electronic commerce
- Querying spatial databases via topological invariants
- Conjunctive-query containment and constraint satisfaction
- Rewriting queries using views over monadic database schemas
- Correspondence and translation for heterogeneous data
- Expressiveness of concept expressions in first-order description logics
- Query automata over finite trees
- The expressiveness of DAC
- LARS: a logic-based framework for analytic reasoning over streams
- Containment of queries for graphs with data
- Logic-based argumentation with existential rules
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints
- A progression semantics for first-order logic programs
- Certifying standard and stratified Datalog inference engines in SSReflect
- First-order -calculus over generic transition systems and applications to the situation calculus
- Logical foundations of information disclosure in ontology-based data integration
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results
- Enhancing context knowledge repositories with justifiable exceptions
- Magic sets for disjunctive Datalog programs
- Matching dependencies: semantics and query answering
- A complete axiomatization of fuzzy functional dependencies using fuzzy function
- Minimal-change integrity maintenance using tuple deletions
- On the complexity of deciding typability in the relational algebra
- Active integrity constraints for general-purpose knowledge bases
- A technique for proving decidability of containment and equivalence of linear constraint queries
- On the complexity of data disjunctions.
- Adding for-loops to first-order logic
- Abstract state machines and computationally complete query languages
- Functional queries in datalog
- On the decidability of the termination problem of active database systems
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning
- From orthogonal projections to a generalized quantum search
- Heterogeneous active agents. III: Polynomially implementable agents
- Functional dependency restricted insertion propagation
- Semi-oblivious chase termination: the sticky case
- Consistent query answering for primary keys in Datalog
- Pruning external minimality checking for answer set programs using semantic dependencies
- On the complexity and approximability of repair position selection problem
- Situation calculus for controller synthesis in manufacturing systems with first-order state representation
- A logic-based approach to incremental reasoning on multi-agent systems
- Logical separability of labeled data examples under ontologies
- The fine-grained complexity of multi-dimensional ordering properties
- Fast left Kan extensions using the chase
- On sampling representatives of relational schemas with a functional dependency
- On the expressive power of message-passing neural networks as global feature map transformers
- Can you answer while you wait?
- Optimizing multiset relational algebra queries using weak-equivalent rewrite rules
- Local higher-order fixpoint iteration
- The delay and window size problems in rule-based stream reasoning
- Expressive power and succinctness of the positive calculus of binary relations
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Modular materialisation of Datalog programs
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Inference-proof updating of a weakened view under the modification of input parameters
- Counting subset repairs with functional dependencies
- Open-world probabilistic databases: semantics, algorithms, complexity
- Answering regular path queries in expressive description logics via alternating tree-automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864249)
