On the public citation graph

Constructive negation and constraint logic programming with sets

https://doi.org/10.1007/bf03037598
0 signed · 47 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1995.1048openalex-snapshot
Negation and Constraint Logic Programming
inferredcites →https://doi.org/10.1007/3-540-19129-1_4openalex-snapshot
Unification Revisited
inferredcites →https://doi.org/10.1007/3-540-46584-7_9openalex-snapshot
How to Incorporate Negation in a Prolog Compiler?
inferredcites →https://doi.org/10.1007/3-540-59155-9_5openalex-snapshot
Constructive negation by pruning and optimization higher-order predicates for CLP and CC languages
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
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-94-017-0435-9openalex-snapshot
Automated Deduction — A Basis for Applications
inferredcites →https://doi.org/10.1007/bf01185404openalex-snapshot
What is failure? An approach to constructive negation
inferredcites →https://doi.org/10.1016/0167-9236(90)90027-oopenalex-snapshot
Unification theory
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(90)90023-xopenalex-snapshot
A transformational approach to negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(91)80001-topenalex-snapshot
A practical framework for theabstract interpretation of logic programs
inferredcites →https://doi.org/10.1016/0743-1066(91)90036-oopenalex-snapshot
Set constructors in a logic database language
inferredcites →https://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/0743-1066(95)00146-8openalex-snapshot
Matching of bounded set terms in the logic language LDL++
inferredcites →https://doi.org/10.1016/0743-1066(95)00147-6openalex-snapshot
{log}: A language for programming in logic with finite sets
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
inferredcites →https://doi.org/10.1016/s0020-0190(00)00046-6openalex-snapshot
A necessary condition for Constructive Negation in Constraint Logic Programming
inferredcites →https://doi.org/10.1016/s0049-237x(09)70566-xopenalex-snapshot
On a Theorem of Cobham Concerning Undecidable Theories
inferredcites →https://doi.org/10.1017/s0022481200040135openalex-snapshot
A system of axiomatic set theory—Part I
inferredcites →https://doi.org/10.1017/s095679689700261xopenalex-snapshot
A foundation for actor computation
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
inferredcites →https://doi.org/10.1145/115865.115872openalex-snapshot
Abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/32204.32219openalex-snapshot
Extending relational algebra and relational calculus with set-valued attributes and aggregate functions
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.2307/2268864openalex-snapshot
A system of axiomatic set theory - Part VII
inferredcites →https://doi.org/10.3233/fi-1998-36235openalex-snapshot
A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms
inferredcites →https://doi.org/10.7551/mitpress/4299.003.0010openalex-snapshot
Non-Failure Analysis for Logic Programs
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0062openalex-snapshot
Compiling Intensional Sets in CLP

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_20openalex-snapshot
Intensional Sets in CLP
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_34openalex-snapshot
Smodels with CLP—A Treatment of Aggregates in ASP
inferred← citeshttps://doi.org/10.1007/978-3-540-30200-1_3openalex-snapshot
An Abductive Framework for Information Exchange in Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/s10817-021-09589-wopenalex-snapshot
Automated Reasoning with Restricted Intensional Sets
inferred← citeshttps://doi.org/10.1017/s147106840500236xopenalex-snapshot
A CHR-based implementation of known arc-consistency
inferred← citeshttps://doi.org/10.1017/s1471068406002936openalex-snapshot
A Constructive semantic characterization of aggregates in answer set programming
inferred← citeshttps://doi.org/10.1109/policy.2010.16openalex-snapshot
QoP and QoS Policy Cognizant Module Composition
inferred← citeshttps://doi.org/10.1145/1029133.1029140openalex-snapshot
A logic-based framework for attribute based access control
inferred← citeshttps://doi.org/10.1145/365151.365169openalex-snapshot
Sets and constraint logic programming
inferred← citeshttps://doi.org/10.3233/fun-2006-71403openalex-snapshot
Foundations of Paraconsistent Resolution
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2178openalex-snapshot
Simplifying Negative Goals Using Typed Existence Properties
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601051openalex-snapshot
A Constructive Semantic Characterization of Aggregates in ASP
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0605038openalex-snapshot
An Unfolding-Based Semantics for Logic Programming with Aggregates
inferred← citeshttps://doi.org/10.7551/mitpress/4316.003.0062openalex-snapshot
Compiling Intensional Sets in CLP
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.