On the public citation graph
A prolog technology theorem prover: Implementation by an extended prolog compiler
0 signed · 236 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-16780-3_123openalex-snapshot
Paths to high-performance automated theorem proving
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_19openalex-snapshot
The Linked Inference Principle, II: The User’s Viewpoint
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_2openalex-snapshot
A Portable Environment for Research in Automated Reasoning
inferredcites →https://doi.org/10.1007/978-1-4757-1968-0_9openalex-snapshot
Chess 4.5: The Northwestern University Chess Program
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_32openalex-snapshot
Linear Resolution with Selection Function
inferredcites →https://doi.org/10.1007/978-3-642-96868-6_135openalex-snapshot
Markgraf Karl Refutation Procedure
inferredcites →https://doi.org/10.1007/978-3-662-06239-5_4openalex-snapshot
CHESS 4.5—The Northwestern University chess program
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf00244944openalex-snapshot
Non-Horn clause logic programming without contrapositives
inferredcites →https://doi.org/10.1007/bf03037328openalex-snapshot
A Prolog technology theorem prover
inferredcites →https://doi.org/10.1007/bfb0000052openalex-snapshot
Logic machine architecture: Kernel functions
inferredcites →https://doi.org/10.1007/bfb0000053openalex-snapshot
Logic machine architecture: Inference mechanisms
inferredcites →https://doi.org/10.1016/0004-3702(71)90012-9openalex-snapshot
Linear resolution with selection function
inferredcites →https://doi.org/10.1016/0004-3702(80)90026-0openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1016/0004-3702(82)90041-8openalex-snapshot
A simplified problem reduction format
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0020-0255(76)90698-8openalex-snapshot
Experimental tests of resolution-based theorem-proving strategies
inferredcites →https://doi.org/10.1109/tc.1976.1674614openalex-snapshot
A Hole in Goal Trees: Some Guidance from Resolution Theory
inferredcites →https://doi.org/10.1109/tc.1976.1674697openalex-snapshot
Resolution, Refinements, and Search Strategies: A Comparative Study
inferredcites →https://doi.org/10.1145/12808.12833openalex-snapshot
Automated theorem proving: mapping logic into AI
inferredcites →https://doi.org/10.1145/214956.214960openalex-snapshot
Describing Prolog by its interpretation and compilation
inferredcites →https://doi.org/10.1145/321526.321527openalex-snapshot
A Simplified Format for the Model Elimination Theorem-Proving Procedure
inferredcites →https://doi.org/10.1145/321796.321807openalex-snapshot
An Implementation of the Model Elimination Proof Procedure
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
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.1998.2739openalex-snapshot
On the Modelling of Search in Theorem Proving— Towards a Theory of Strategy Analysis
inferred← citeshttps://doi.org/10.1006/inco.1999.2863openalex-snapshot
Efficient Model Generation through Compilation
inferred← citeshttps://doi.org/10.1006/jsco.1999.0363openalex-snapshot
Controlled Use of Clausal Lemmas in Connection Tableau Calculi
inferred← citeshttps://doi.org/10.1007/11552222_5openalex-snapshot
Ten Theses on Logic Languages for the Semantic Web
inferred← citeshttps://doi.org/10.1007/11562931_33openalex-snapshot
The Need for Ancestor Resolution When Answering Queries in Horn Clause Logic
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-44881-0_26openalex-snapshot
Equational Prover of Theorema
inferred← citeshttps://doi.org/10.1007/3-540-44960-4_8openalex-snapshot
Theory Completion Using Inverse Entailment
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-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_21openalex-snapshot
Minimal Answer Computation and SOL
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_15openalex-snapshot
Lemma Generalization and Non-unit Lemma Matching for Model Elimination
inferred← citeshttps://doi.org/10.1007/3-540-47922-8_6openalex-snapshot
Clue as a Testbed for Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_3openalex-snapshot
A Taxonomy of Theorem-Proving Strategies
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_31openalex-snapshot
Abstraction-Based Relevancy Testing for Model Elimination
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_37openalex-snapshot
Automated Theorem Proving in a Combination of Theories with Disjoint Signatures
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_135openalex-snapshot
A prolog technology theorem prover: A new exposition and implementation in Prolog
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_104openalex-snapshot
Perspectives on automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_136openalex-snapshot
A prolog technology theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_76openalex-snapshot
A complete semantic back chaining proof system
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_78openalex-snapshot
Partheo: A high-performance parallel theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_81openalex-snapshot
Case-free programs: An abstraction of definite horn programs
inferred← citeshttps://doi.org/10.1007/3-540-53082-7_26openalex-snapshot
Rationale and methods for abductive reasoning in natural-language interpretation
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_121openalex-snapshot
How well are non-horn clauses handled?
inferred← citeshttps://doi.org/10.1007/3-540-54712-6_258openalex-snapshot
Efficient compilation of first order predicates
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_2openalex-snapshot
Parallel theorem provers An overview
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_6openalex-snapshot
Experiments with Roo, a parallel automated deduction system
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_171openalex-snapshot
Linear-input subset analysis
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_215openalex-snapshot
KPROP — An AND-parallel theorem prover for propositional logic implemented in KL1 system abstract
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_1openalex-snapshot
SLWV — A theorem prover for logic programming
inferred← citeshttps://doi.org/10.1007/3-540-56602-3_125openalex-snapshot
Inductive logic programming: Derivations, successes and shortcomings
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_41openalex-snapshot
The many faces of inductive logic programming
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_41openalex-snapshot
Search space pruning by checking dynamic term growth
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_64openalex-snapshot
A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems
inferred← citeshttps://doi.org/10.1007/3-540-57802-1_8openalex-snapshot
Theory reasoning in first order calculi
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_35openalex-snapshot
A novel asynchronous parallelism scheme for first-order logic
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_57openalex-snapshot
Protein: A PROver with a Theory Extension INterface
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_58openalex-snapshot
DELTA — A bottom-up preprocessor for top-down theorem provers
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_7openalex-snapshot
Model elimination without contrapositives
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_12openalex-snapshot
An implementation technique for a class of bottom-up procedures
inferred← citeshttps://doi.org/10.1007/3-540-58487-0_2openalex-snapshot
Evaluating a formal modelling language
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_36openalex-snapshot
Specifications of inference rules and their automatic translation
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_105openalex-snapshot
Efficient model generation through compilation
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_97openalex-snapshot
Optimizing proof search in model elimination
inferred← citeshttps://doi.org/10.1007/3-540-61532-6_32openalex-snapshot
On semantic resolution with lemmaizing and contraction
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_16openalex-snapshot
Lemma matching for a PTTP-based top-down theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_31openalex-snapshot
GLUE: Opening the world to theorem provers
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_3openalex-snapshot
Reachability Analysis for the Extension Procedure — A Topological Result —
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_9openalex-snapshot
Integrity Constraints: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-46714-2_11openalex-snapshot
Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_13openalex-snapshot
From Schütte’s Formal Systems to Modern Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_33openalex-snapshot
Prolog Technology Reinforcement Learning Prover
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_4openalex-snapshot
Learning from Łukasiewicz and Meredith: Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_1openalex-snapshot
Range-Restricted and Horn Interpolation through Clausal Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_9openalex-snapshot
Lemmas: Generation, Selection, Application
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_11openalex-snapshot
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_1openalex-snapshot
History and Prospects for First-Order Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-319-23540-0_26openalex-snapshot
Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_21openalex-snapshot
nanoCoP: A Non-clausal Connection Prover
inferred← citeshttps://doi.org/10.1007/978-3-319-48628-4_9openalex-snapshot
Advances in Connection-Based Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_12openalex-snapshot
Generalised Kernel Sets for Inverse Entailment
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_21openalex-snapshot
Hybrid Abductive Inductive Learning: A Generalisation of Progol
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_23openalex-snapshot
leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_45openalex-snapshot
Closures and Modules Within Linear Logic Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_24openalex-snapshot
Building Theorem Provers
inferred← citeshttps://doi.org/10.1007/978-3-642-05082-4_6openalex-snapshot
Search for More Declarativity
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_28openalex-snapshot
An Approximative Inference Method for Solving ∃ ∀SO Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/978-3-642-75182-0_51openalex-snapshot
P A R T H E O: A Parallel Inference Machine
inferred← citeshttps://doi.org/10.1007/978-94-007-7284-7_7openalex-snapshot
Abductive Reasoning with a Large Knowledge Base for Discourse Processing
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_14openalex-snapshot
PTTP and Linked Inference
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_2openalex-snapshot
METEORs: High Performance Theorem Provers using Model Elimination
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_4openalex-snapshot
Perspectives on Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_15openalex-snapshot
Properties and Relations of Tableau and Connection Calculi
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_6openalex-snapshot
Developing Deduction Systems: The Toolbox Style
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_7openalex-snapshot
Specifications of Inference Rules: Extensions of the PTTP Technique
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_10openalex-snapshot
Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_11openalex-snapshot
Deduction-Based Software Component Retrieval
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_10openalex-snapshot
Implementing Semantic Tableaux
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_3openalex-snapshot
First-Order Tableau Methods
inferred← citeshttps://doi.org/10.1007/bf00244282openalex-snapshot
SETHEO: A high-performance theorem prover
inferred← citeshttps://doi.org/10.1007/bf00244283openalex-snapshot
The linked inference principle, I: The formal treatment
inferred← citeshttps://doi.org/10.1007/bf00244355openalex-snapshot
A sequent-style model elimination strategy and a positive refinement
inferred← citeshttps://doi.org/10.1007/bf00244357openalex-snapshot
Interest driven suppositional reasoning
inferred← citeshttps://doi.org/10.1007/bf00247825openalex-snapshot
Eliminating duplication with the hyper-linking strategy
inferred← citeshttps://doi.org/10.1007/bf00283133openalex-snapshot
Automated generation of readable proofs with geometric invariants
inferred← citeshttps://doi.org/10.1007/bf00283134openalex-snapshot
Automated generation of readable proofs with geometric invariants
inferred← citeshttps://doi.org/10.1007/bf00849080openalex-snapshot
Approaches to abductive reasoning: an overview
inferred← citeshttps://doi.org/10.1007/bf00880011openalex-snapshot
Formal reasoning in intelligent database systems
inferred← citeshttps://doi.org/10.1007/bf00881910openalex-snapshot
Parallelization of deduction strategies: An analytical study
inferred← citeshttps://doi.org/10.1007/bf00881946openalex-snapshot
METEOR: Exploring model elimination theorem proving
inferred← citeshttps://doi.org/10.1007/bf00881947openalex-snapshot
Controlled integration of the cut rule into connection tableau calculi
inferred← citeshttps://doi.org/10.1007/bf00881948openalex-snapshot
Model elimination without contrapositives and its application to PTTP
inferred← citeshttps://doi.org/10.1007/bf00881952openalex-snapshot
Tableau-based theorem provers: Systems and implementations
inferred← citeshttps://doi.org/10.1007/bf00881955openalex-snapshot
Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
inferred← citeshttps://doi.org/10.1007/bf00885766openalex-snapshot
Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures
inferred← citeshttps://doi.org/10.1007/bf01014021openalex-snapshot
An autonomous multistrategy theorem proving system using knowledge-based techniques
inferred← citeshttps://doi.org/10.1007/bf01101857openalex-snapshot
Weighted abduction for plan ascription
inferred← citeshttps://doi.org/10.1007/bf01530763openalex-snapshot
Avoiding duplicate proofs with the foothold refinement
inferred← citeshttps://doi.org/10.1007/bf01531174openalex-snapshot
A prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation
inferred← citeshttps://doi.org/10.1007/bf01543481openalex-snapshot
The application of automated reasoning to questions in mathematics and logic
inferred← citeshttps://doi.org/10.1007/bf01989745openalex-snapshot
Execution of logic programs by iterative-deepening A* SLD-tree search
inferred← citeshttps://doi.org/10.1007/bf02341855openalex-snapshot
Comparing parameter schemes for propositional reasoning: An empirical study
inferred← citeshttps://doi.org/10.1007/bf02945765openalex-snapshot
On the complexities of non-Horn Clause logic programming
inferred← citeshttps://doi.org/10.1007/bf03037149openalex-snapshot
Compiling a default reasoning system into Prolog
inferred← citeshttps://doi.org/10.1007/bf03037315openalex-snapshot
On semantic resolution with lemmaizing and contraction and a formal treatment of caching
inferred← citeshttps://doi.org/10.1007/bfb0012839openalex-snapshot
Case inference in resolution-based languages
inferred← citeshttps://doi.org/10.1007/bfb0022562openalex-snapshot
On loop detection in connection calculi
inferred← citeshttps://doi.org/10.1007/bfb0027415openalex-snapshot
Subgoal alternation in model elimination
inferred← citeshttps://doi.org/10.1007/bfb0029622openalex-snapshot
Unrestricted resolution versus N-resolution
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0038693openalex-snapshot
Some applications of Gentzen's proof theory in automated deduction
inferred← citeshttps://doi.org/10.1007/bfb0038699openalex-snapshot
Logic programming, functional programming, and inductive definitions
inferred← citeshttps://doi.org/10.1007/bfb0054243openalex-snapshot
System description: similarity-based lemma generation for model elimination
inferred← citeshttps://doi.org/10.1007/bfb0054273openalex-snapshot
Using matings for pruning connection tableaux
inferred← citeshttps://doi.org/10.1007/bfb0055910openalex-snapshot
Cooperation between top-down and bottom-up theorem provers by subgoal clause transfer
inferred← citeshttps://doi.org/10.1007/bfb0057448openalex-snapshot
Acquisition of useful lemma-knowledge in automated reasoning
inferred← citeshttps://doi.org/10.1007/s10817-015-9334-4openalex-snapshot
Semantically-Guided Goal-Sensitive Reasoning: Model Representation
inferred← citeshttps://doi.org/10.1007/s10817-015-9342-4openalex-snapshot
Mark Stickel: His Earliest Work
inferred← citeshttps://doi.org/10.1007/s10817-021-09590-3openalex-snapshot
Craig Interpolation with Clausal First-Order Tableaux
inferred← citeshttps://doi.org/10.1007/s10817-024-09711-8openalex-snapshot
Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1016/0004-3702(89)90011-8openalex-snapshot
Refinements to depth-first iterative-deepening search in automatic theorem proving
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90030-2openalex-snapshot
Linear resolution for consequence finding
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90044-xopenalex-snapshot
A semantic backward chaining proof system
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90082-5openalex-snapshot
Problem solving by searching for models with a theorem prover
inferred← citeshttps://doi.org/10.1016/0303-2647(94)01453-eopenalex-snapshot
A precondition prover for analogy
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90168-fopenalex-snapshot
A Prolog technology theorem prover: a new exposition and implementation in Prolog
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90216-3openalex-snapshot
Unrestricted resolution versus N-resolution
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90008-dopenalex-snapshot
Automated theorem proving and logic programming: a natural symbiosis
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90035-3openalex-snapshot
Inductive Logic Programming: Theory and methods
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50021-7openalex-snapshot
Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations
inferred← citeshttps://doi.org/10.1016/c2009-0-27773-7openalex-snapshot
Artificial Intelligence: A New Synthesis
inferred← citeshttps://doi.org/10.1016/j.artint.2003.07.001openalex-snapshot
Logic-based subsumption architecture
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104361openalex-snapshot
A semantics for probabilistic hybrid knowledge bases with function symbols
inferred← citeshttps://doi.org/10.1016/j.eswa.2005.04.013openalex-snapshot
A multi-agent framework for distributed theorem proving
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.130672openalex-snapshot
Can multimodal large language models understand visual metaphors? An evaluation of MLLM’s multi-perspective understanding capabilities for visual metaphors
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00042-2openalex-snapshot
Computing answers with model elimination
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00046-xopenalex-snapshot
Clause trees: a tool for understanding and implementing resolution in automated reasoning
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00007-6openalex-snapshot
Non-Horn clause logic programming
inferred← citeshttps://doi.org/10.1016/s0005-1098(96)00165-3openalex-snapshot
Validation and verification of decision making rules
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00037-3openalex-snapshot
leanCoP: lean connection-based theorem proving
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03001-5openalex-snapshot
Chapter 1 Knowledge Representation and Classical Logic
inferred← citeshttps://doi.org/10.1017/s0269888900008134openalex-snapshot
Logic engineering in medicine
inferred← citeshttps://doi.org/10.1017/s147106841400012xopenalex-snapshot
Tabling, Rational Terms, and Coinduction Finally Together!
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of Logic Programming
inferred← citeshttps://doi.org/10.1023/a:1005770705587openalex-snapshot
The Use of Lemmas in the Model Elimination Procedure
inferred← citeshttps://doi.org/10.1023/a:1005808119103openalex-snapshot
SETHEO and E-SETHEO - The CADE-13 Systems
inferred← citeshttps://doi.org/10.1023/a:1005812703468openalex-snapshot
A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion
inferred← citeshttps://doi.org/10.1023/a:1005885725562openalex-snapshot
Nagging: A Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference
inferred← citeshttps://doi.org/10.1023/a:1006469202251openalex-snapshot
Parallelization of a Hyper-Linking–Based Theorem Prover
inferred← citeshttps://doi.org/10.1023/a:1015134701251openalex-snapshot
Connection Tableau Calculi with Disjunctive Constraints
inferred← citeshttps://doi.org/10.1023/a:1018976510663openalex-snapshot
Heuristics used by HERBY for semantic tree theorem proving
inferred← citeshttps://doi.org/10.1023/b:mach.0000023149.72125.e2openalex-snapshot
Induction as Consequence Finding
inferred← citeshttps://doi.org/10.1049/ic.2005.0749openalex-snapshot
Reasoning on the semantic web: beyond ontology languages and reasoners
inferred← citeshttps://doi.org/10.1080/00207160108805059openalex-snapshot
Improving the time efficiency of proving theorems using a learning mechanism
inferred← citeshttps://doi.org/10.1080/00207169608804524openalex-snapshot
The practicality of generating semantic trees for proofs of unsatisfiability
inferred← citeshttps://doi.org/10.1090/mcom/3889openalex-snapshot
A Prolog assisted search for new simple Lie algebras
inferred← citeshttps://doi.org/10.1093/oso/9780198537618.003.0004openalex-snapshot
Designing a Theorem Prover
inferred← citeshttps://doi.org/10.1109/fuzz48607.2020.9177798openalex-snapshot
Using SAT/SMT Solvers for Efficiently Tuning Fuzzy Logic Programs
inferred← citeshttps://doi.org/10.1109/icci.1992.227643openalex-snapshot
A self-guided theorem proving system
inferred← citeshttps://doi.org/10.1109/icci.1992.227667openalex-snapshot
Use of unit clauses and clause splitting in automatic deduction
inferred← citeshttps://doi.org/10.1109/iccitechn.2010.5723892openalex-snapshot
Towards a tableau based high performance automated theorem prover
inferred← citeshttps://doi.org/10.1109/is.2004.1344652openalex-snapshot
A parallelism-oriented prover with a meta-predicate
inferred← citeshttps://doi.org/10.1112/s1461157000000759openalex-snapshot
Ergo 6: A Generic Proof Engine that Uses Prolog Proof Technology
inferred← citeshttps://doi.org/10.1137/0222044openalex-snapshot
Regular Resolution Versus Unrestricted Resolution
inferred← citeshttps://doi.org/10.1142/9789812813411_0041openalex-snapshot
Subsumption, a Sometimes Undervalued Procedure
inferred← citeshttps://doi.org/10.1142/s0218213001000477openalex-snapshot
AN AUTOMATED THEOREM PROVER BASED ON CONNECTION TABLEAU CALCULI WITH DISJUNCTIVE CONSTRAINTS
inferred← citeshttps://doi.org/10.1145/162754.168691openalex-snapshot
Finding fixed point combinators using Prolog
inferred← citeshttps://doi.org/10.1145/2676724.2693176openalex-snapshot
Certified Connection Tableaux Proofs for HOL Light and TPTP
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.64.991openalex-snapshot
Automatic Proving of Fuzzy Formulae with Fuzzy Logic Programming and SMT
inferred← citeshttps://doi.org/10.1613/jair.573openalex-snapshot
Cooperation between Top-Down and Bottom-Up Theorem Provers
inferred← citeshttps://doi.org/10.17863/cam.16363openalex-snapshot
PrologPF: Parallel Logic and Functions on the Delphi Machine
inferred← citeshttps://doi.org/10.24963/ijcai.2017/695openalex-snapshot
nanoCoP: Natural Non-clausal Theorem Proving
inferred← citeshttps://doi.org/10.3115/976744.976777openalex-snapshot
Abductive explanation of dialogue misunderstandings
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0073openalex-snapshot
A Generic Tableau Prover and its Integration with Isabelle
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-719openalex-snapshot
ProbLog Technology for Inference in a Probabilistic First Order Logic
inferred← citeshttps://doi.org/10.3233/aic-2010-0464openalex-snapshot
Restricting backtracking in connection calculi
inferred← citeshttps://doi.org/10.3233/fi-1999-391207openalex-snapshot
On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi
inferred← citeshttps://doi.org/10.48456/tr-205openalex-snapshot
Logic Programming, Functional Programming, and Inductive Definitions
inferred← citeshttps://doi.org/10.48456/tr-872openalex-snapshot
The integration of higher order interactive proof with first order automatic theorem proving
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3938openalex-snapshot
Efficiently Retrieving Function Dependencies in the Linux Kernel Using XSB
inferred← citeshttps://doi.org/10.48550/arxiv.1410.5476openalex-snapshot
Certified Connection Tableaux Proofs for HOL Light and TPTP
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11137openalex-snapshot
PIE -- Proving, Interpolating and Eliminating on the Basis of First-Order Logic
showing the first 200 of 207 · page through all 207
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.