On the public citation graph
Constraint databases: A survey
0 signed · 167 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1996.0043openalex-snapshot
Indexing for Data Models with Constraints and Classes
inferredcites →https://doi.org/10.1006/jcss.1997.1524openalex-snapshot
Finitely Representable Databases
inferredcites →https://doi.org/10.1007/3-540-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1007/3-540-53507-1_78openalex-snapshot
On the expressive power of the relational calculus with arithmetic constraints
inferredcites →https://doi.org/10.1007/3-540-57887-0_92openalex-snapshot
Constraint programming and database query languages
inferredcites →https://doi.org/10.1007/3-540-58601-6_100openalex-snapshot
Linear vs. polynomial constraints in database query languages
inferredcites →https://doi.org/10.1007/3-540-58601-6_107openalex-snapshot
Set constraints and set-based analysis
inferredcites →https://doi.org/10.1007/3-540-58601-6_110openalex-snapshot
Set constraints: Results, applications and future directions
inferredcites →https://doi.org/10.1007/3-540-58907-4_2openalex-snapshot
Spatial databases, The final frontier
inferredcites →https://doi.org/10.1007/3-540-58907-4_25openalex-snapshot
Constraint-generating dependencies
inferredcites →https://doi.org/10.1007/3-540-58907-4_32openalex-snapshot
Datalog queries of set constraint databases
inferredcites →https://doi.org/10.1007/3-540-60299-2_10openalex-snapshot
Safe stratified datalog with integer order programs
inferredcites →https://doi.org/10.1007/3-540-60794-3openalex-snapshot
Constraint Databases and Application
inferredcites →https://doi.org/10.1007/3-540-60794-3_14openalex-snapshot
DISCO: A constraint database system with sets
inferredcites →https://doi.org/10.1007/3-540-62222-5_61openalex-snapshot
Efficient indexing for constraint and temporal databases
inferredcites →https://doi.org/10.1007/3-540-62222-5_62openalex-snapshot
On topological elementary equivalence of spatial databases
inferredcites →https://doi.org/10.1007/3-540-62222-5_63openalex-snapshot
Model-theoretic minimal change operators for constraint databases
inferredcites →https://doi.org/10.1007/3-540-62501-1openalex-snapshot
Constraint Databases and Applications
inferredcites →https://doi.org/10.1007/3-540-62501-1_30openalex-snapshot
The C 3 constraint object-oriented database system: An overview
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-663-12018-6openalex-snapshot
Dependencies in Relational Databases
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_5openalex-snapshot
Super-Exponential Complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf01213204openalex-snapshot
Domain independence and the relational calculus
inferredcites →https://doi.org/10.1007/bf01530796openalex-snapshot
Subsumption and indexing in constraint query languages with linear arithmetic constraints
inferredcites →https://doi.org/10.1007/bf01530930openalex-snapshot
Deriving constraints among argument sizes in logic programs
inferredcites →https://doi.org/10.1007/bf01543475openalex-snapshot
Computational complexity and constraint logic programming languages
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/bfb0062837openalex-snapshot
The Computational Complexity of Logical Theories
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/springerreference_61847openalex-snapshot
Constraint Query Languages
inferredcites →https://doi.org/10.1016/0004-3702(77)90002-9openalex-snapshot
On the complexity of admissible search algorithms
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0020-0255(74)90008-5openalex-snapshot
Networks of constraints: Fundamental properties and applications to picture processing
inferredcites →https://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0022-0000(86)90029-2openalex-snapshot
The complexity of elementary algebra and geometry
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
inferredcites →https://doi.org/10.1016/0022-0000(91)90032-zopenalex-snapshot
Datalog extensions for database queries and updates
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0096-0551(89)90014-3openalex-snapshot
Integrating relational databases and constraint languages
inferredcites →https://doi.org/10.1016/0097-3165(76)90055-8openalex-snapshot
Fourier-Motzkin elimination extension to integer programming problems
inferredcites →https://doi.org/10.1016/0098-3004(91)90117-vopenalex-snapshot
The design and analysis of spatial data structures
inferredcites →https://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
inferredcites →https://doi.org/10.1016/0304-3975(77)90037-8openalex-snapshot
An efficient decision procedure for the theory of rational order
inferredcites →https://doi.org/10.1016/0304-3975(93)90222-fopenalex-snapshot
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
inferredcites →https://doi.org/10.1016/0743-1066(85)90002-0openalex-snapshot
Horn clause queries and generalizations
inferredcites →https://doi.org/10.1016/0743-1066(91)90026-lopenalex-snapshot
Magic templates: a spellbinding approach to logic programs
inferredcites →https://doi.org/10.1016/0743-1066(93)90043-gopenalex-snapshot
Towards a meaning of life
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-1-4832-1313-2.50037-8openalex-snapshot
ON SAFETY, DOMAIN INDEPENDENCE, AND CAPTURABILITY OF DATABASE QUERIES* (Preliminary Report)*Research sponsored in part by the NSF grant DCR-8603676.
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50131-7openalex-snapshot
Complexity Results for First-Order Theories of Temporal Constraints
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0022-0000(05)80071-6openalex-snapshot
Datalog vs first-order logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71811-1openalex-snapshot
Remarks on Tarski's problem concerning (R, +, *, exp)
inferredcites →https://doi.org/10.1016/s0743-1066(97)10008-5openalex-snapshot
Datalog with integer periodicity constraints
inferredcites →https://doi.org/10.1016/s0747-7171(10)80003-3openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
inferredcites →https://doi.org/10.1016/s0747-7171(10)80005-7openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
inferredcites →https://doi.org/10.1017/s0269888900000564openalex-snapshot
The Knowledge Engineering Review
inferredcites →https://doi.org/10.1017/s0269888900005798openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.1023/a:1009751730500openalex-snapshot
Refining Restriction Enzyme Genome Maps
inferredcites →https://doi.org/10.1109/icde.1993.344049openalex-snapshot
Representation and querying in temporal databases: the power of temporal constraints
inferredcites →https://doi.org/10.1109/lics.1995.523246openalex-snapshot
First-order queries on finite structures over the reals
inferredcites →https://doi.org/10.1109/sfcs.1977.23openalex-snapshot
Precise bounds for presburger arithmetic and the reals with addition: Preliminary report
inferredcites →https://doi.org/10.1109/sfcs.1985.4openalex-snapshot
Algebraic cell decomposition in NC
inferredcites →https://doi.org/10.1137/0204006openalex-snapshot
A Decision Procedure for the First Order Theory of Real Addition with Order
inferredcites →https://doi.org/10.1142/s0218196798000260openalex-snapshot
The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases
inferredcites →https://doi.org/10.1145/113413.113429openalex-snapshot
Constraint-based query optimization for spatial databases
inferredcites →https://doi.org/10.1145/113413.113434openalex-snapshot
Inference of inequality constraints in logic programs (extended abstracts)
inferredcites →https://doi.org/10.1145/113413.113439openalex-snapshot
On the representation of infinite temporal data and queries (extended abstract)
inferredcites →https://doi.org/10.1145/129393.129398openalex-snapshot
The CLP( ℛ ) language and system
inferredcites →https://doi.org/10.1145/137097.137111openalex-snapshot
Constraints and redundancy in datalog
inferredcites →https://doi.org/10.1145/137097.137892openalex-snapshot
Implementing deductive databases by linear programming
inferredcites →https://doi.org/10.1145/137097.137902openalex-snapshot
The complexity of querying indefinite data about linearly ordered domains
inferredcites →https://doi.org/10.1145/151634.151635openalex-snapshot
Finite representation of infinite query answers
inferredcites →https://doi.org/10.1145/153850.153860openalex-snapshot
Equivalence, query-reachability and satisfiability in Datalog extensions
inferredcites →https://doi.org/10.1145/153850.153884openalex-snapshot
Indexing for data models with constraints and classes (extended abstract)
inferredcites →https://doi.org/10.1145/182591.182595openalex-snapshot
Path caching (extended abstract)
inferredcites →https://doi.org/10.1145/182591.182598openalex-snapshot
Compiling query constraints (extended abstract)
inferredcites →https://doi.org/10.1145/182591.182609openalex-snapshot
New techniques for studying set languages, bag languages and aggregate functions
inferredcites →https://doi.org/10.1145/182591.182612openalex-snapshot
Universal finiteness and satisfiability (extended abstract)
inferredcites →https://doi.org/10.1145/182591.182640openalex-snapshot
Towards a theory of spatial database queries
inferredcites →https://doi.org/10.1145/182591.182654openalex-snapshot
Finitely representable databases (extended abstract)
inferredcites →https://doi.org/10.1145/212433.212447openalex-snapshot
Constraint programming and database languages
inferredcites →https://doi.org/10.1145/212433.212449openalex-snapshot
Separability of polyhedra for optimal filtering of spatial and constraint data
inferredcites →https://doi.org/10.1145/212433.212453openalex-snapshot
Dense-order constraint databases (extended abstract)
inferredcites →https://doi.org/10.1145/212433.212477openalex-snapshot
Finite queries do not have effective syntax
inferredcites →https://doi.org/10.1145/237661.237667openalex-snapshot
Relational expressive power of constraint query languages
inferredcites →https://doi.org/10.1145/237661.237669openalex-snapshot
Linear vs. order constraint queries over rational databases (extended abstract)
inferredcites →https://doi.org/10.1145/237661.237672openalex-snapshot
Towards practical constraint databases (extended abstract)
inferredcites →https://doi.org/10.1145/237661.237673openalex-snapshot
Variable independence and aggregation closure
inferredcites →https://doi.org/10.1145/237661.237676openalex-snapshot
Point vs. interval-based query languages for temporal databases (extended abstract)
inferredcites →https://doi.org/10.1145/237661.237683openalex-snapshot
Topological queries in spatial databases
inferredcites →https://doi.org/10.1145/237661.237693openalex-snapshot
Chasing constrained tuple-generating dependencies
inferredcites →https://doi.org/10.1145/28395.28409openalex-snapshot
The Boolean formula value problem is in ALOGTIME
inferredcites →https://doi.org/10.1145/288086.288088openalex-snapshot
Safe query languages for constraint databases
inferredcites →https://doi.org/10.1145/298514.298541openalex-snapshot
Deriving constraints among argument sizes in logic programs (extended abstract)
inferredcites →https://doi.org/10.1145/298514.298589openalex-snapshot
Polynomial time query processing in temporal deductive databases
inferredcites →https://doi.org/10.1145/298514.298590openalex-snapshot
Handling infinite temporal data
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322332openalex-snapshot
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/357146.357147openalex-snapshot
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
inferredcites →https://doi.org/10.1145/357980.358007openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/359642.359654openalex-snapshot
Synthesizing constraint expressions
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/42267.42273openalex-snapshot
On conjunctive queries containing inequalities
inferredcites →https://doi.org/10.1145/567752.567763openalex-snapshot
Universality of data retrieval languages
inferredcites →https://doi.org/10.1145/66926.66942openalex-snapshot
Relational specifications of infinite query answers
inferredcites →https://doi.org/10.1145/67544.66942openalex-snapshot
Relational specifications of infinite query answers
inferredcites →https://doi.org/10.1145/79204.79209openalex-snapshot
Constraint logic programming languages
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/800105.803397openalex-snapshot
Optimal implementation of conjunctive queries in relational data bases
inferredcites →https://doi.org/10.1145/800133.804352openalex-snapshot
On time-space classes and their relation to the theory of real addition
inferredcites →https://doi.org/10.1145/800133.804361openalex-snapshot
Presburger arithmetic with bounded quantifier alternation
inferredcites →https://doi.org/10.1145/96709.96733openalex-snapshot
Concurrent constraint programming
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2266510openalex-snapshot
Definability and decision problems in arithmetic
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
inferredcites →https://doi.org/10.5860/choice.32-1575openalex-snapshot
From logic to logic programming
inferredcites →https://doi.org/10.7551/mitpress/3133.001.0001openalex-snapshot
From Logic to Logic Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11527862_1openalex-snapshot
Verifying the Incorrectness of Programs and Automata
inferred← citeshttps://doi.org/10.1007/11827405_89openalex-snapshot
Modeling and Inferring on Role-Based Access Control Policies Using Data Dependencies
inferred← citeshttps://doi.org/10.1007/11935308_12openalex-snapshot
Distributed Credential Chain Discovery in Trust Management with Parameterized Roles and Constraints (Short Paper)
inferred← citeshttps://doi.org/10.1007/3-540-36388-2_6openalex-snapshot
Datalog with Constraints: A Foundation for Trust Management Languages
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_2openalex-snapshot
Applications of Alfred Tarski’s Ideas in Database Theory
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_26openalex-snapshot
Safe Datalog Queries with Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-45558-2_9openalex-snapshot
The Expressive Power of Revised Datalog on Problems with Closure Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-30204-9_1openalex-snapshot
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_6openalex-snapshot
Conditional Privacy-Aware Role Based Access Control
inferred← citeshttps://doi.org/10.1007/978-3-540-77048-0_30openalex-snapshot
Auth-SL - A System for the Specification and Enforcement of Quality-Based Authentication Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-22194-1_23openalex-snapshot
Piecewise Surface Regression Modeling in Intelligent Decision Guidance System
inferred← citeshttps://doi.org/10.1016/j.is.2011.12.001openalex-snapshot
A unified framework for heterogeneous patterns
inferred← citeshttps://doi.org/10.1016/s0166-3615(02)00010-6openalex-snapshot
Database support for evolving data in product design
inferred← citeshttps://doi.org/10.1109/csf.2007.18openalex-snapshot
Design and Semantics of a Decentralized Authorization Language
inferred← citeshttps://doi.org/10.1109/csfw.2003.1212713openalex-snapshot
Using first-order logic to reason about policies
inferred← citeshttps://doi.org/10.1109/time.2010.24openalex-snapshot
Local Polynomial Regression Models for Average Traffic Speed Estimation and Forecasting in Linear Constraint Databases
inferred← citeshttps://doi.org/10.1117/12.667844openalex-snapshot
AKSED: adaptive knowledge-based system for event detection using collaborative unmanned aerial vehicles
inferred← citeshttps://doi.org/10.1145/1376616.1376696openalex-snapshot
Querying continuous functions in a database system
inferred← citeshttps://doi.org/10.1145/1755913.1755943openalex-snapshot
Policy-based access control for weakly consistent replication
inferred← citeshttps://doi.org/10.1145/2618243.2618249openalex-snapshot
Inverse predictions on continuous models in scientific databases
inferred← citeshttps://doi.org/10.1145/273865.273870openalex-snapshot
Relational expressive power of constraint query languages
inferred← citeshttps://doi.org/10.14778/3380750.3380752openalex-snapshot
Personal insights for altering decisions of tree-based ensembles over time
inferred← citeshttps://doi.org/10.3233/jcs-2009-0364openalex-snapshot
SecPAL: Design and semantics of a decentralized authorization language
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601034openalex-snapshot
Using First-Order Logic to Reason about Policies
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.