On the public citation graph
Constructing finite algebras with FALCON
0 signed · 51 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/3-540-55602-8_223openalex-snapshot
MGTP: A parallel theorem prover based on lazy model generation
inferredcites →https://doi.org/10.1007/3-540-58156-1_54openalex-snapshot
Problems on the generation of finite models
inferredcites →https://doi.org/10.1007/3-540-58156-1_6openalex-snapshot
A method for building models automatically. Experiments with an extension of OTTER
inferredcites →https://doi.org/10.1007/bf00881795openalex-snapshot
The kernel strategy and its use for the study of combinatory logic
inferredcites →https://doi.org/10.1007/bfb0019355openalex-snapshot
Using resolution for deciding solvable classes and building finite models
inferredcites →https://doi.org/10.1016/0004-3702(94)90082-5openalex-snapshot
Problem solving by searching for models with a theorem prover
inferredcites →https://doi.org/10.1016/0898-1221(94)00219-bopenalex-snapshot
Automated reasoning and exhaustive search: Quasigroup existence problems
inferredcites →https://doi.org/10.1080/00029890.1993.11990393openalex-snapshot
Tarski's High School Identities
inferredcites →https://doi.org/10.1080/0025570x.1990.11977530openalex-snapshot
A Remark on Boolean Rings
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/322307.322308openalex-snapshot
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721959_24openalex-snapshot
Two Techniques to Improve Finite Model Search
inferred← citeshttps://doi.org/10.1007/11532231_32openalex-snapshot
Computer Search for Counterexamples to Wilkie’s Identity
inferred← citeshttps://doi.org/10.1007/11814771_28openalex-snapshot
Geometric Resolution: A Proof Procedure Based on Finite Model Search
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/3-540-45578-7_8openalex-snapshot
The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_16openalex-snapshot
A Note on Symmetry Heuristics in SEM
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_19openalex-snapshot
Reasoning by Symmetry and Function Ordering in Finite Model Generation
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_35openalex-snapshot
The eXtended Least Number Heuristic
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_37openalex-snapshot
System Description: MCS: Model-Based Conjecture Searching
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_24openalex-snapshot
Constraint propagation in model generation
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_96openalex-snapshot
System description generating models by SEM
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_17openalex-snapshot
Automatic Generation of Logical Models with AGES
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_9openalex-snapshot
Extending Finite Model Searching with Congruence Closure Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_48openalex-snapshot
Development of Correct Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_16openalex-snapshot
An Incremental Answer Set Programming Based System for Finite ModelComputation
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_13openalex-snapshot
Finding Finite Herbrand 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/978-3-662-07080-2_24openalex-snapshot
Belohnungssysteme für eine wahrheitsgemäße Berichterstattung über den Erwartungswert einer stochastischen Größe
inferred← citeshttps://doi.org/10.1007/bfb0055904openalex-snapshot
Finite model search for equational theories (FMSET)
inferred← citeshttps://doi.org/10.1007/s10817-006-9040-3openalex-snapshot
Predicting and Detecting Symmetries in FOL Finite Model Search
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.07.023openalex-snapshot
Reducing Symmetries to Generate Easier SAT Instances
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.075openalex-snapshot
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
inferred← citeshttps://doi.org/10.1109/tools.1997.713562openalex-snapshot
Finite model generation and formal specification development
inferred← citeshttps://doi.org/10.1109/tse.2023.3256939openalex-snapshot
New Techniques for Static Symmetry Breaking in Many-Sorted Finite Model Finding
inferred← citeshttps://doi.org/10.1145/276393.276396openalex-snapshot
Isomorph-free model enumeration
inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28643openalex-snapshot
SAT-Based Techniques for Lexicographically Smallest Finite Models
inferred← citeshttps://doi.org/10.1609/aimag.v37i2.2620openalex-snapshot
The CADE ATP System Competition — CASC
inferred← citeshttps://doi.org/10.21236/ada339198openalex-snapshot
Selective Enumeration: A Formal Definition
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.29007/slrmopenalex-snapshot
Experiments on Infinite Model Finding in SMT Solving
inferred← citeshttps://doi.org/10.3233/faia240980openalex-snapshot
Cube-Based Isomorph-Free Finite Model Finding
inferred← citeshttps://doi.org/10.3233/fi-1999-391202openalex-snapshot
A Hybrid Method for Finite Model Search in Equational Theories
inferred← citeshttps://doi.org/10.48550/arxiv.2003.02882openalex-snapshot
Static Symmetry Breaking in Many-Sorted Finite Model Finding
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-437openalex-snapshot
Finite Model Computation via Answer Set Programming
inferred← citeshttps://doi.org/10.56415/qrs.v32.23openalex-snapshot
Construction of gyrogroups of order 2n by cyclic 2-groups
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.