On the public citation graph

MACE 2.0 reference manual and guide.

https://doi.org/10.2172/797949
0 signed · 45 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/3-540-61398-6openalex-snapshot
Automated Deduction in Equational Logic and Cubic Curves
inferredcites →https://doi.org/10.1007/978-1-4757-3188-0_16openalex-snapshot
Ivy: A Preprocessor and Proof Checker for First-Order Logic
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1016/s0020-0190(98)00015-5openalex-snapshot
Automatic proofs and counterexamples for some ortholattice identities
inferredcites →https://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11814771_29openalex-snapshot
A Powerful Technique to Eliminate Isomorphism in Finite Model Search
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_30openalex-snapshot
Exploring Theories with a Model-Finding Assistant
inferred← citeshttps://doi.org/10.1007/978-3-319-98938-9_8openalex-snapshot
Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
inferred← citeshttps://doi.org/10.1007/978-3-540-24572-8_12openalex-snapshot
Reasoning in Attempto Controlled English
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_36openalex-snapshot
The CADE ATP System Competition
inferred← citeshttps://doi.org/10.1007/978-3-540-30132-5_97openalex-snapshot
Representing Knowledge in Controlled Natural Language: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_27openalex-snapshot
Verification Support Environment
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_8openalex-snapshot
ILP for Mathematical Discovery
inferred← citeshttps://doi.org/10.1007/978-3-540-73920-3_9openalex-snapshot
Computational Discovery in Pure Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_13openalex-snapshot
Automated Model Building: From Finite to Infinite Models
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_5openalex-snapshot
MACE4 and SEM: A Comparison of Finite Model Generators
inferred← citeshttps://doi.org/10.1007/b94439openalex-snapshot
Principles and Practice of Semantic Web Reasoning
inferred← citeshttps://doi.org/10.1007/s00012-003-1832-2openalex-snapshot
Yet another single law for lattices
inferred← citeshttps://doi.org/10.1007/s10472-009-9143-8openalex-snapshot
Constructing infinite models represented by tree automata
inferred← citeshttps://doi.org/10.1007/s10817-004-5097-zopenalex-snapshot
A Proof Environment for Teaching Mathematics
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.07.023openalex-snapshot
Reducing Symmetries to Generate Easier SAT Instances
inferred← citeshttps://doi.org/10.1017/s1471068408003451openalex-snapshot
Checking the quality of clinical guidelines using automated reasoning tools
inferred← citeshttps://doi.org/10.1023/a:1020542009983openalex-snapshot
Short Single Axioms for Boolean Algebra
inferred← citeshttps://doi.org/10.1023/a:1027322305654openalex-snapshot
A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke
inferred← citeshttps://doi.org/10.1080/08839510701252650openalex-snapshot
USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00016openalex-snapshot
Live Programming for Finite Model Finders
inferred← citeshttps://doi.org/10.1109/ictai.2016.0074openalex-snapshot
An Algorithm to Compute Minimal Unsatisfiable Subsets for a Decidable Fragment of First-Order Formulas
inferred← citeshttps://doi.org/10.1109/micai.2006.43openalex-snapshot
Skolem Functions and Herbrand Universes in a Tree Generalization of First Order Logic
inferred← citeshttps://doi.org/10.1145/1081706.1081740openalex-snapshot
Relational analysis of algebraic datatypes
inferred← citeshttps://doi.org/10.1145/1182613.1182618openalex-snapshot
Logical characterizations of heap abstractions
inferred← citeshttps://doi.org/10.1145/1868294.1868303openalex-snapshot
Automatic and efficient simulation of operation contracts
inferred← citeshttps://doi.org/10.1145/3772318.3790621openalex-snapshot
The Way We Notice, That’s What Really Matters: Instantiating UI Components with Distinguishing Variations
inferred← citeshttps://doi.org/10.1145/3803437.3805576openalex-snapshot
Towards Output Directed Debugging of Finite Model Finders
inferred← citeshttps://doi.org/10.1360/jos160327openalex-snapshot
Generating SAT Instances from First-Order Formulas
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.15.176openalex-snapshot
Executing Underspecified OCL Operation Contracts with a SAT Solver
inferred← citeshttps://doi.org/10.14712/1213-7243.2015.134openalex-snapshot
Antiflexible Latin directed triple systems
inferred← citeshttps://doi.org/10.17077/etd.qktdxyneopenalex-snapshot
Evolving model evolution
inferred← citeshttps://doi.org/10.2172/822573openalex-snapshot
OTTER 3.3 reference manual.
inferred← citeshttps://doi.org/10.2172/822574openalex-snapshot
Mace4 reference manual and guide.
inferred← citeshttps://doi.org/10.2172/822575openalex-snapshot
Short equational bases for ortholattices : proofs and countermodels.
inferred← citeshttps://doi.org/10.29007/tcvwopenalex-snapshot
Razor: Provenance and Exploration in Model-Finding
inferred← citeshttps://doi.org/10.4018/978-1-61692-014-2.ch010openalex-snapshot
Applying Lakatos-Style Reasoning to AI Domains
inferred← citeshttps://doi.org/10.4018/jswis.2012100105openalex-snapshot
Adimen-SUMO
inferred← citeshttps://doi.org/10.48550/arxiv.1310.4938openalex-snapshot
A Logic-based Approach for Recognizing Textual Entailment Supported by Ontological Background Knowledge
inferred← citeshttps://doi.org/10.48550/arxiv.1905.04422openalex-snapshot
Controlled Natural Languages and Default Reasoning
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.