On the public citation graph
Preference queries in deductive databases
0 signed · 44 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.1007/978-1-4615-3506-5_11openalex-snapshot
Efficient Bottom-Up Evaluation of Logic Programs
inferredcites →https://doi.org/10.1007/978-3-662-02906-0_9openalex-snapshot
Modal nonmonotonic logics
inferredcites →https://doi.org/10.1007/bf01530953openalex-snapshot
Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning
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)90046-jopenalex-snapshot
Hierarchical constraint logic programming
inferredcites →https://doi.org/10.1145/113413.113427openalex-snapshot
Minimum and maximum predicates in logic programming
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/137097.137852openalex-snapshot
Monotonic aggregation in deductive databases
inferredcites →https://doi.org/10.1145/137097.137854openalex-snapshot
The well-founded semantics of aggregation
inferredcites →https://doi.org/10.1145/195613.195646openalex-snapshot
Modular stratification and magic sets for Datalog programs with negation
inferredcites →https://doi.org/10.1145/237721.237735openalex-snapshot
Optimization and relaxation in constraint logic languages
inferredcites →https://doi.org/10.1145/298514.298582openalex-snapshot
Constraint query languages (preliminary report)
inferredcites →https://doi.org/10.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/73721.73736openalex-snapshot
Bottom-up beats top-down for datalog
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0070openalex-snapshot
Preference 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/11425274_38openalex-snapshot
Frequent Pattern Mining with Preferences–Utility Functions Approach
inferred← citeshttps://doi.org/10.1007/11605126_8openalex-snapshot
Querying with Preferences in a Digital Library
inferred← citeshttps://doi.org/10.1007/11663881_5openalex-snapshot
Iterative Modification and Incremental Evaluation of Preference Queries
inferred← citeshttps://doi.org/10.1007/3-540-45876-x_5openalex-snapshot
Querying with Intrinsic Preferences
inferred← citeshttps://doi.org/10.1007/978-3-319-11508-5_19openalex-snapshot
Answering Ontological Ranking Queries Based on Subjective Reports
inferred← citeshttps://doi.org/10.1007/978-3-319-65229-0_2openalex-snapshot
Models for Representing User Preferences
inferred← citeshttps://doi.org/10.1007/978-3-540-25954-1_8openalex-snapshot
Semantic Optimization of Preference Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-00672-2_6openalex-snapshot
Data Quality Aware Queries in Collaborative Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12814-1_6openalex-snapshot
Avoiding Inconsistency in User Preferences for Data Quality Aware Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-20244-5_46openalex-snapshot
A Framework for Data Quality Aware Query Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31709-5_52openalex-snapshot
Encoding Preference Queries to an Uncertain Database in Possibilistic Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-41030-7_36openalex-snapshot
Preference-Based Query Answering in Probabilistic Datalog+/- Ontologies
inferred← citeshttps://doi.org/10.1007/978-981-10-3002-4_3openalex-snapshot
AdaUK-Means: An Ensemble Boosting Clustering Algorithm on Uncertain Objects
inferred← citeshttps://doi.org/10.1007/s00799-003-0068-2openalex-snapshot
Rule-based query personalization in digital libraries
inferred← citeshttps://doi.org/10.1007/s10472-007-9072-3openalex-snapshot
Database querying under changing preferences
inferred← citeshttps://doi.org/10.1007/s13740-014-0040-xopenalex-snapshot
Preference-Based Query Answering in Probabilistic Datalog+/– Ontologies
inferred← citeshttps://doi.org/10.1016/j.is.2006.05.002openalex-snapshot
Semantic optimization techniques for preference queries
inferred← citeshttps://doi.org/10.1016/j.is.2014.05.005openalex-snapshot
A framework for data quality aware query systems
inferred← citeshttps://doi.org/10.1016/j.jalgor.2009.02.002openalex-snapshot
Modeling preferences and conditional preferences on resource consumption and production in ASP
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.002openalex-snapshot
Higher-order logic programming: An expressive language for representing qualitative preferences
inferred← citeshttps://doi.org/10.1145/1401890.1401940openalex-snapshot
Mining preferences from superior and inferior examples
inferred← citeshttps://doi.org/10.1145/958942.958946openalex-snapshot
Preference formulas in relational queries
inferred← citeshttps://doi.org/10.4018/jdwm.2005100103openalex-snapshot
Preference-Based Frequent Pattern Mining
inferred← citeshttps://doi.org/10.48550/arxiv.1312.0032openalex-snapshot
Top-k Query Answering in Datalog+/- Ontologies under Subjective Reports (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0406029openalex-snapshot
Subset Queries in Relational Databases
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3896openalex-snapshot
Contextualized and personalized location-based services
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.