On the public citation graph

Explicit representation of terms defined by counter examples

0 signed · 96 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.1007/978-1-4684-3384-5_11openalex-snapshot

Negation as Failure

inferredcites →https://doi.org/10.1016/0004-3702(80)90038-7openalex-snapshot

Multilevel counterfactuals for generalizations of relational concepts and productions

inferredcites →https://doi.org/10.1016/0167-7136(83)90132-4openalex-snapshot

A theory and methodology of inductive learning

inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot

A Machine-Oriented Logic Based on the Resolution Principle

inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1048openalex-snapshot

Negation and Constraint Logic Programming

inferred← citeshttps://doi.org/10.1006/inco.2000.2915openalex-snapshot

Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models

inferred← citeshttps://doi.org/10.1006/jsco.1994.1049openalex-snapshot

Tree Automata Help One To Solve Equational Formulae In AC-Theories

inferred← citeshttps://doi.org/10.1006/jsco.1996.0041openalex-snapshot

AC Complement Problems: Satisfiability and Negation Elimination

inferred← citeshttps://doi.org/10.1006/jsco.1998.0203openalex-snapshot

Negation Elimination in Empty or Permutative Theories

inferred← citeshttps://doi.org/10.1006/jsco.1999.0361openalex-snapshot

Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria

inferred← citeshttps://doi.org/10.1007/10721975_13openalex-snapshot

The Explicit Representability of Implicit Generalizations

inferred← citeshttps://doi.org/10.1007/11532231_30openalex-snapshot

Model Representation via Contexts and Implicit Generalizations

inferred← citeshttps://doi.org/10.1007/11663881_2openalex-snapshot

Equational Constraint Solving Via a Restricted Form of Universal Quantification

inferred← citeshttps://doi.org/10.1007/11799573_32openalex-snapshot

Solving First-Order Constraints in the Theory of the Evaluated Trees

inferred← citeshttps://doi.org/10.1007/11853886_15openalex-snapshot

Model Representation over Finite and Infinite Signatures

inferred← citeshttps://doi.org/10.1007/3-540-19426-6_1openalex-snapshot

From unification to constraints

inferred← citeshttps://doi.org/10.1007/3-540-44622-2_28openalex-snapshot

Elimination of Negation in a Logical Framework

inferred← citeshttps://doi.org/10.1007/3-540-45022-x_52openalex-snapshot

Negation Elimination from Simple Equational Formulae

inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot

Constraint Solving on Terms

inferred← citeshttps://doi.org/10.1007/3-540-46508-1_14openalex-snapshot

Extending Decidable Clause Classes via Constraints

inferred← citeshttps://doi.org/10.1007/3-540-46562-6_25openalex-snapshot

Patterns in Words versus Patterns in Trees: A Brief Survey and New Results

inferred← citeshttps://doi.org/10.1007/3-540-48660-7_7openalex-snapshot

Solving Equational Problems Efficiently

inferred← citeshttps://doi.org/10.1007/3-540-49545-2_14openalex-snapshot

Algorithms on Atomic Representations of Herbrand Models

inferred← citeshttps://doi.org/10.1007/3-540-50676-4_8openalex-snapshot

Fundamental mechanisms for artificial intelligence programming languages

inferred← citeshttps://doi.org/10.1007/3-540-53904-2_105openalex-snapshot

On relationship between term rewriting systems and regular tree languages

inferred← citeshttps://doi.org/10.1007/3-540-53904-2_120openalex-snapshot

Open problems in rewriting

inferred← citeshttps://doi.org/10.1007/3-540-54345-7_44openalex-snapshot

Elimination of negation in term algebras

inferred← citeshttps://doi.org/10.1007/3-540-54345-7_72openalex-snapshot

A solution of the complement problem in associatiue-commutatiue theories

inferred← citeshttps://doi.org/10.1007/3-540-55808-x_17openalex-snapshot

Negation elimination in equational formulae

inferred← citeshttps://doi.org/10.1007/3-540-56393-8_21openalex-snapshot

Computing linearizations using test sets

inferred← citeshttps://doi.org/10.1007/3-540-56730-5_39openalex-snapshot

A solution of the complement problem in associatiue-commutatiue theories

inferred← citeshttps://doi.org/10.1007/3-540-56868-9_24openalex-snapshot

The negation elimination from syntactic equational formula is decidable

inferred← citeshttps://doi.org/10.1007/3-540-56868-9_27openalex-snapshot

AC complement problems: Satisfiability and negation elimination

inferred← citeshttps://doi.org/10.1007/3-540-56868-9_39openalex-snapshot

More problems in rewriting

inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_5openalex-snapshot

Soft Sorting in Logic Programming

inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_13openalex-snapshot

Speed-up Transformations of Logic Programs by Abstraction and Learning

inferred← citeshttps://doi.org/10.1007/978-3-031-12441-9_9openalex-snapshot

Checking Sufficient Completeness by Inductive Theorem Proving

inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_6openalex-snapshot

Infinite-State Model Checking of LTLR Formulas Using Narrowing

inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_5openalex-snapshot

NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment

inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_6openalex-snapshot

First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation

inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_3openalex-snapshot

Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras

inferred← citeshttps://doi.org/10.1007/978-3-319-41135-4_3openalex-snapshot

Advances in Property-Based Testing for $$\alpha $$ Prolog

inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_9openalex-snapshot

Anti-pattern Matching

inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_12openalex-snapshot

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains

inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_10openalex-snapshot

Classes of Tree Homomorphisms with Decidable Preservation of Regularity

inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_30openalex-snapshot

Decidability Results for Saturation-Based Model Building

inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_10openalex-snapshot

Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning

inferred← citeshttps://doi.org/10.1007/978-3-662-21551-7_27openalex-snapshot

AC complement problems: Satisfiability and negation elimination

inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_2openalex-snapshot

Symbolic Reasoning Methods in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/bf01212959openalex-snapshot

Sufficient-completeness, ground-reducibility and their complexity

inferred← citeshttps://doi.org/10.1007/bf01534454openalex-snapshot

On inductive inference of cyclic structures

inferred← citeshttps://doi.org/10.1007/bf01893885openalex-snapshot

Sufficient-completeness, ground-reducibility and their complexity

inferred← citeshttps://doi.org/10.1007/bfb0029631openalex-snapshot

Pumping lemmrs for tree languages generated by rewrite systems

inferred← citeshttps://doi.org/10.1007/bfb0030389openalex-snapshot

A polynomial time algorithm for finding finite unions of tree pattern languages

inferred← citeshttps://doi.org/10.1007/bfb0055775openalex-snapshot

On the word, subsumption, and complement problem for recurrent term schematizations

inferred← citeshttps://doi.org/10.1007/s00165-017-0415-5openalex-snapshot

Equational formulas and pattern operations in initial order-sorted algebras

inferred← citeshttps://doi.org/10.1007/s10472-004-9434-zopenalex-snapshot

On Deciding Subsumption Problems

inferred← citeshttps://doi.org/10.1016/0167-6423(88)90002-0openalex-snapshot

Refined compiliation of pattern-matching for functional languages

inferred← citeshttps://doi.org/10.1016/0743-1066(90)90023-xopenalex-snapshot

A transformational approach to negation in logic programming

inferred← citeshttps://doi.org/10.1016/0743-1066(92)90019-yopenalex-snapshot

A procedural semantics for well-founded negation in logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot

Constraint logic programming: a survey

inferred← citeshttps://doi.org/10.1016/0890-5401(90)90033-eopenalex-snapshot

Tools for proving inductive equalities, relative completeness, and ω-completeness

inferred← citeshttps://doi.org/10.1016/b978-1-55860-200-7.50088-xopenalex-snapshot

Learning Constrained Atoms

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.073openalex-snapshot

A New Proposal Of Quasi-Solved Form For Equality Constraint Solving

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.03.032openalex-snapshot

A Transformational Approach to Prove Outermost Termination Automatically

inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101100openalex-snapshot

Nominal anti-unification modulo equational theories

inferred← citeshttps://doi.org/10.1016/j.jsc.2010.01.007openalex-snapshot

Anti-patterns for rule-based languages

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.038openalex-snapshot

The DNF exception problem

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00583-2openalex-snapshot

Explicit versus implicit representations of subsets of the Herbrand universe

inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10027-4openalex-snapshot

Constructive negation under the well-founded semantics

inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00029-4openalex-snapshot

On the complexity of equational problems in CNF

inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot

Equational problems anddisunification

inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00016-6openalex-snapshot

Extracting models from clause sets saturated under semantic refinements of the resolution rule

inferred← citeshttps://doi.org/10.1017/s1471068407003171openalex-snapshot

Theory of finite or infinite trees revisited

inferred← citeshttps://doi.org/10.1017/s1471068417000035openalex-snapshot

αCheck: A mechanized metatheory model checker

inferred← citeshttps://doi.org/10.1023/a:1006376231563openalex-snapshot

Ordered Semantic Hyper-Linking

inferred← citeshttps://doi.org/10.1023/a:1009868906501openalex-snapshot

A Methodological View of Constraint Solving

inferred← citeshttps://doi.org/10.1093/logcom/7.3.367openalex-snapshot

Regular search spaces and constructive negation

inferred← citeshttps://doi.org/10.1093/logcom/exm008openalex-snapshot

Model Representation over Finite and Infinite Signatures

inferred← citeshttps://doi.org/10.1093/oso/9780198538509.003.0003openalex-snapshot

A Generalization of the Least General Generalization

inferred← citeshttps://doi.org/10.1109/lics.1988.5132openalex-snapshot

Complete axiomatizations of the algebras of finite, rational and infinite trees

inferred← citeshttps://doi.org/10.1109/lics.1990.113733openalex-snapshot

A constraint sequent calculus

inferred← citeshttps://doi.org/10.1109/lics.1991.151657openalex-snapshot

Constructive negation for constraint logic programming

inferred← citeshttps://doi.org/10.1109/lics.1999.782625openalex-snapshot

Working with arms: Complexity results on atomic representations of Herbrand models

inferred← citeshttps://doi.org/10.1109/tai.1990.130343openalex-snapshot

Learning from examples and counterexamples with equational background knowledge

inferred← citeshttps://doi.org/10.1137/090777669openalex-snapshot

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete

inferred← citeshttps://doi.org/10.1145/1273920.1273931openalex-snapshot

Mechanized metatheory model-checking

inferred← citeshttps://doi.org/10.1145/3767744openalex-snapshot

A Nominal Approach to Equational Problems in Languages with Binders

inferred← citeshttps://doi.org/10.1145/73721.73724openalex-snapshot

A procedural semantics for well founded negation in logic programs

inferred← citeshttps://doi.org/10.1145/937555.937559openalex-snapshot

Higher-order pattern complement and the strict λ-calculus

inferred← citeshttps://doi.org/10.22028/d291-25997openalex-snapshot

Saturation-based decision procedures for fixed domain and minimal model validity

inferred← citeshttps://doi.org/10.23638/lmcs-13(4:28)2017openalex-snapshot

Matching Logic

inferred← citeshttps://doi.org/10.3233/fi-1995-24127openalex-snapshot

REGULAR TREE LANGUAGES AND REWRITE SYSTEMS

inferred← citeshttps://doi.org/10.3233/fi-1996-25201openalex-snapshot

ON SETS OF TERMS: A STUDY OF A GENERALISATION RELATION AND OF ITS ALGORITHMIC PROPERTIES

inferred← citeshttps://doi.org/10.48550/arxiv.1502.05501openalex-snapshot

NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Full Paper)

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.