On the public citation graph
Automated deduction by theory resolution
0 signed · 260 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-10009-1_7openalex-snapshot
Variable elimination and chaining in a resolution-based prover for inequalities
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-3-642-81955-1_17openalex-snapshot
E-Resolution: Extension of Resolution to Include the Equality Relation
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1016/0004-3702(85)90029-3openalex-snapshot
A mechanical solution of Schubert's Steamroller by many-sorted resolution
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferredcites →https://doi.org/10.1109/mc.1983.1654200openalex-snapshot
Krypton: A Functional Approach to Knowledge Representation
inferredcites →https://doi.org/10.1145/182.358434openalex-snapshot
Maintaining knowledge about temporal intervals
inferredcites →https://doi.org/10.1145/2422.322411openalex-snapshot
Deciding Combinations of Theories
inferredcites →https://doi.org/10.1145/321592.321603openalex-snapshot
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
inferredcites →https://doi.org/10.1145/321738.321748openalex-snapshot
Z-Resolution: Theorem-Proving with Compiled Axioms
inferredcites →https://doi.org/10.1145/322077.322078openalex-snapshot
Another Generalization of Resolution
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1145/355611.362538openalex-snapshot
Experiment with an automatic theorem-prover having partial ordering inference rules
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/4904.4905openalex-snapshot
Special relations in automated deduction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.4550060403openalex-snapshot
Time and time again: The many ways to represent time
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1988.tb00230.xopenalex-snapshot
The Basics of Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1006/jsco.1996.0009openalex-snapshot
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
inferred← citeshttps://doi.org/10.1006/jsco.1999.0365openalex-snapshot
Connection Calculus Theorem Proving with Multiple Built-in Theories
inferred← citeshttps://doi.org/10.1007/10720084_3openalex-snapshot
Integrating Constraint Solving into Proof Planning
inferred← citeshttps://doi.org/10.1007/10720084_5openalex-snapshot
Axioms vs. Rewrite Rules: From Completeness to Cut Elimination
inferred← citeshttps://doi.org/10.1007/10722086_14openalex-snapshot
A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning
inferred← citeshttps://doi.org/10.1007/11552222_13openalex-snapshot
Computational Treatment of Temporal Notions: The CTTN–System
inferred← citeshttps://doi.org/10.1007/11552222_5openalex-snapshot
Ten Theses on Logic Languages for the Semantic Web
inferred← citeshttps://doi.org/10.1007/11575863_15openalex-snapshot
Integration of Heterogeneous Knowledge Sources in the CALO Query Manager
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_102openalex-snapshot
Theory links in semantic graphs
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_117openalex-snapshot
A classification of many-sorted unification problems
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_126openalex-snapshot
How to clear a block: Plan formation in situational logic
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_135openalex-snapshot
The markgraf karl refutation procedure (MKRP)
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_146openalex-snapshot
The KLAUS automated deduction system
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_91openalex-snapshot
Resolution and quantified epistemic logics
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_22openalex-snapshot
Deriving Focused Calculi for Transitive Relations
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_16openalex-snapshot
A Confluent Theory Connection Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_3openalex-snapshot
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_1openalex-snapshot
Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory
inferred← citeshttps://doi.org/10.1007/3-540-47993-7_23openalex-snapshot
Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies
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-48685-2_26openalex-snapshot
HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_19openalex-snapshot
A Simple Sequent System for First-Order Logic with Free Constructors
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_60openalex-snapshot
Narrowing with built-in theories
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_77openalex-snapshot
Solving equations in an equational language
inferred← citeshttps://doi.org/10.1007/3-540-52337-6_19openalex-snapshot
A calculus for order-sorted predicate logic with sort literals
inferred← citeshttps://doi.org/10.1007/3-540-52337-6_27openalex-snapshot
What KL-ONE lookalikes need to cope with natural language
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-52753-2_46openalex-snapshot
New ways for developing proof theories for first-order multi modal logics
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_87openalex-snapshot
A resolution principle for clauses with constraints
inferred← citeshttps://doi.org/10.1007/3-540-53082-7_15openalex-snapshot
Knowledge processing in the LILOG project from the first to the second prototype
inferred← citeshttps://doi.org/10.1007/3-540-53104-1_29openalex-snapshot
A new diagnosis approach by deduction and abduction
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_111openalex-snapshot
Constrained equational deduction
inferred← citeshttps://doi.org/10.1007/3-540-54507-7_13openalex-snapshot
Building in equational theories into the connection method
inferred← citeshttps://doi.org/10.1007/3-540-55124-7_9openalex-snapshot
Unification in varieties of completely regular semigroups
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_155openalex-snapshot
Unification in the union of disjoint equational theories: Combining decision procedures
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_187openalex-snapshot
The special-relation rules are incomplete
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_197openalex-snapshot
A many sorted logic with possibly empty sorts
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_206openalex-snapshot
Herky: High performance rewriting in RRL
inferred← citeshttps://doi.org/10.1007/3-540-55930-2_16openalex-snapshot
Knowledge representation for natural language processing
inferred← citeshttps://doi.org/10.1007/3-540-56869-7_17openalex-snapshot
Qualitative and topological relationships in spatial databases
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-58107-3_14openalex-snapshot
Reasoning with analogical representations
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_20openalex-snapshot
Primal grammars and unification modulo a binary clause
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-59155-9_8openalex-snapshot
On the use of constraints in automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_28openalex-snapshot
Using connection method in modal logics: Some advantages
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-59338-1_37openalex-snapshot
Constraint model elimination and a PTTP-implementation
inferred← citeshttps://doi.org/10.1007/3-540-60437-5_17openalex-snapshot
Composing decision procedures: the approach and a case study
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_7openalex-snapshot
Incremental theory reasoning methods for semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_44openalex-snapshot
A category-based equational logic semantics to constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_78openalex-snapshot
A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_13openalex-snapshot
A practical integration of first-order reasoning and decision procedures
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_45openalex-snapshot
Towards the one-tiered design of data types and transition systems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4980-1_12openalex-snapshot
Notes on Inference: A Somewhat Skewed Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-23161-2_300700openalex-snapshot
Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_14openalex-snapshot
Axiomatic Constraint Systems for Proof Search Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_1openalex-snapshot
Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_15openalex-snapshot
Superposition Modulo a Shostak Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_12openalex-snapshot
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_13openalex-snapshot
Efficient E-Matching for SMT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-89437-7_2openalex-snapshot
Software Engineering for Ensembles
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_19openalex-snapshot
(LIA) - Model Evolution with Linear Integer Arithmetic Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_20openalex-snapshot
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_25openalex-snapshot
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
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-14309-0_3openalex-snapshot
Theory-Specific Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_9openalex-snapshot
Model Evolution with Equality Modulo Built-in Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_28openalex-snapshot
E-Matching with Free Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_14openalex-snapshot
The Relative Power of Semantics and Unification
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_3openalex-snapshot
Canonical Ground Horn Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-60085-2_13openalex-snapshot
Adding Constraints to Logic-based Formalisms
inferred← citeshttps://doi.org/10.1007/978-3-642-71385-9_23openalex-snapshot
The Semantic Clause Graph Procedure — A First Overview
inferred← citeshttps://doi.org/10.1007/978-3-642-74064-0_19openalex-snapshot
Using Theory Resolution to Simplify Interpreted Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_24openalex-snapshot
Reasoning for Text Understanding - Knowledge Processing in the 1st LILOG-Prototype
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_9openalex-snapshot
Detecting Redundancy Caused by Congruent Links in Clause Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_2openalex-snapshot
Fundamentals of Deductive Program Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-662-02711-0_2openalex-snapshot
A Completeness Proof Technique for Resolution with Equality
inferred← citeshttps://doi.org/10.1007/978-3-662-02711-0_20openalex-snapshot
Model Representation and Taxonomic Reasoning in Configuration Problem Solving
inferred← citeshttps://doi.org/10.1007/978-3-662-40145-3_3openalex-snapshot
An Introduction to Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-4-431-66942-5_25openalex-snapshot
Implementing an Automated Reasoning System for Multi-Robot Cooperation
inferred← citeshttps://doi.org/10.1007/978-94-007-7284-7_2openalex-snapshot
Deterministic Statistical Mapping of Sentences to Underspecified Semantics
inferred← citeshttps://doi.org/10.1007/978-94-011-0928-4_12openalex-snapshot
Configuration as Model Construction: The Constructive Problem Solving Approach
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_4openalex-snapshot
Perspectives on Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-94-011-7108-3_84openalex-snapshot
A General Framework for Building Intelligent Database Applications
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_2openalex-snapshot
Superposition Theorem Proving for Commutative Rings
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_4openalex-snapshot
Equality and Other Theories
inferred← citeshttps://doi.org/10.1007/bf00243207openalex-snapshot
A more expressive formulation of many sorted logic
inferred← citeshttps://doi.org/10.1007/bf00244283openalex-snapshot
The linked inference principle, I: The formal treatment
inferred← citeshttps://doi.org/10.1007/bf00246025openalex-snapshot
Schubert's Steamroller problem: Formulations and solutions
inferred← citeshttps://doi.org/10.1007/bf00247434openalex-snapshot
How to clear a block: A theory of plans
inferred← citeshttps://doi.org/10.1007/bf00247827openalex-snapshot
How to avoid the derivation of redundant clauses in reasoning systems
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf00297248openalex-snapshot
A new reduction rule for the connection graph proof procedure
inferred← citeshttps://doi.org/10.1007/bf00381143openalex-snapshot
Link inheritance in abstract clause graphs
inferred← citeshttps://doi.org/10.1007/bf01058390openalex-snapshot
Theory matrices (for modal logics) using alphabetical monotonicity
inferred← citeshttps://doi.org/10.1007/bf01190829openalex-snapshot
Refutational theorem proving for hierarchic first-order theories
inferred← citeshttps://doi.org/10.1007/bf01195536openalex-snapshot
Combination problems for commutative/monoidal theories or how algebra can help in equational unification
inferred← citeshttps://doi.org/10.1007/bf01535525openalex-snapshot
Hybridizing nonmonotonic inheritance with theorem proving
inferred← citeshttps://doi.org/10.1007/bf02127744openalex-snapshot
On Skolemization in constrained logics
inferred← citeshttps://doi.org/10.1007/bf02366511openalex-snapshot
Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system
inferred← citeshttps://doi.org/10.1007/bf03037512openalex-snapshot
An epistemic model of logic programming
inferred← citeshttps://doi.org/10.1007/bfb0012820openalex-snapshot
First-order theorem proving using conditional rewrite rules
inferred← citeshttps://doi.org/10.1007/bfb0012846openalex-snapshot
Partial unification for graph based equational reasoning
inferred← citeshttps://doi.org/10.1007/bfb0012850openalex-snapshot
Hyper-chaining and knowledge-based theorem proving
inferred← citeshttps://doi.org/10.1007/bfb0012864openalex-snapshot
An implementation of a dissolution-based system employing theory links
inferred← citeshttps://doi.org/10.1007/bfb0012877openalex-snapshot
Some tools for an inference laboratory (ATINF)
inferred← citeshttps://doi.org/10.1007/bfb0012880openalex-snapshot
The KLAUS automated deduction system
inferred← citeshttps://doi.org/10.1007/bfb0013054openalex-snapshot
An ordered theory resolution calculus
inferred← citeshttps://doi.org/10.1007/bfb0013841openalex-snapshot
Theorem proving for hierarchic first-order theories
inferred← citeshttps://doi.org/10.1007/bfb0018357openalex-snapshot
Unification properties of commutative theories: A categorical treatment
inferred← citeshttps://doi.org/10.1007/bfb0018439openalex-snapshot
Extending resolution for model construction
inferred← citeshttps://doi.org/10.1007/bfb0018458openalex-snapshot
Towards a connection procedure with built in theories
inferred← citeshttps://doi.org/10.1007/bfb0018990openalex-snapshot
A model elimination calculus with built-in theories
inferred← citeshttps://doi.org/10.1007/bfb0022576openalex-snapshot
Completeness of the pool calculus with an open built-in theory
inferred← citeshttps://doi.org/10.1007/bfb0022681openalex-snapshot
An introduction to automated deduction
inferred← citeshttps://doi.org/10.1007/bfb0022718openalex-snapshot
Integration of reasoning and algebraic calculus in geometry
inferred← citeshttps://doi.org/10.1007/bfb0030088openalex-snapshot
Implementing an automated reasoning system for multi-agent knowledge and time
inferred← citeshttps://doi.org/10.1007/bfb0034801openalex-snapshot
Labelled theorem proving for substructural logics
inferred← citeshttps://doi.org/10.1007/bfb0035864openalex-snapshot
Some tools for an inference laboratory (ATINF)
inferred← citeshttps://doi.org/10.1007/bfb0095104openalex-snapshot
Logic programs for intelligent web search
inferred← citeshttps://doi.org/10.1007/s007780050027openalex-snapshot
Building knowledge base management systems
inferred← citeshttps://doi.org/10.1007/s007780050054openalex-snapshot
Maintenance of implication integrity constraints under updates to constraints
inferred← citeshttps://doi.org/10.1007/s10472-009-9153-6openalex-snapshot
Solving quantified verification conditions using satisfiability modulo theories
inferred← citeshttps://doi.org/10.1007/s10515-005-2646-6openalex-snapshot
Automated Procedure Construction for Deductive Synthesis
inferred← citeshttps://doi.org/10.1007/s10817-004-2725-6openalex-snapshot
Constraint Solving for Proof Planning
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-019-09533-zopenalex-snapshot
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice
inferred← citeshttps://doi.org/10.1007/s10817-022-09628-0openalex-snapshot
Set of Support, Demodulation, Paramodulation: A Historical Perspective
inferred← citeshttps://doi.org/10.1016/0004-3702(85)90029-3openalex-snapshot
A mechanical solution of Schubert's Steamroller by many-sorted resolution
inferred← citeshttps://doi.org/10.1016/0004-3702(91)90009-9openalex-snapshot
The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
inferred← citeshttps://doi.org/10.1016/0004-3702(91)90098-5openalex-snapshot
Reduction rules for resolution-based systems
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90055-3openalex-snapshot
An order-sorted logic for knowledge representation systems
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90089-gopenalex-snapshot
Automated design of specialized representations
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00016-topenalex-snapshot
Efficient algorithms for qualitative reasoning about time
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00027-xopenalex-snapshot
A typed resolution principle for deduction with conditional typing theory
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90027-2openalex-snapshot
A resolution principle for constrained logics
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90056-6openalex-snapshot
Hybrid reasoning using universal attachment
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90039-8openalex-snapshot
Unification modulo an equality theory for equational logic programming
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90025-6openalex-snapshot
The origin of a binary-search paradigm
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/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90118-2openalex-snapshot
Exploiting lattices in a theory of space and time
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90119-3openalex-snapshot
Completing sort hierarchies
inferred← citeshttps://doi.org/10.1016/b978-0-12-450010-5.50021-9openalex-snapshot
Monotonicity Properties in Automated Deduction
inferred← citeshttps://doi.org/10.1016/b978-0-444-88771-9.50008-8openalex-snapshot
Compilation of Recursive Two-Literal Clauses into Unification Algorithms**This work was supported by the “Sonderforschungsbereich 314, D2” of the German Science Foundation (DFG).
inferred← citeshttps://doi.org/10.1016/b978-0-934613-04-0.50026-0openalex-snapshot
A RESOLUTION METHOD FOR QUANTIFIED MODAL LOGICS OF KNOWLEDGE AND BELIEF
inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50024-8openalex-snapshot
AN ESSENTIAL HYBRID REASONING SYSTEM: KNOWLEDGE AND SYMBOL LEVEL ACCOUNTS OF KRYPTON
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50004-7openalex-snapshot
Resolution Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50116-0openalex-snapshot
An Efficient Method for Managing Disjunctions in Qualitative Temporal Reasoning
inferred← citeshttps://doi.org/10.1016/b978-1-55860-932-7.x5083-3openalex-snapshot
Knowledge representation and reasoning
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.jal.2005.12.004openalex-snapshot
Defining answer classes using resolution refutation
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00042-2openalex-snapshot
Computing answers with model elimination
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00171-7openalex-snapshot
Swinging types=functions+relations+transition systems
inferred← citeshttps://doi.org/10.1016/s0747-7171(10)80014-8openalex-snapshot
A method for simultaneous search for refutations and models by equational constraint solving
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80064-0openalex-snapshot
Theory links: Applications to automated theorem proving
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80055-0openalex-snapshot
Unification in commutative theories
inferred← citeshttps://doi.org/10.1017/s0960129500003236openalex-snapshot
HOL-λσ: an intentional first-order expression of higher-order logic
inferred← citeshttps://doi.org/10.1017/s0960129599002960openalex-snapshot
Category-based constraint logic
inferred← citeshttps://doi.org/10.1023/a:1005878609884openalex-snapshot
A New Technique for Verifying and Correcting Logic Programs
inferred← citeshttps://doi.org/10.1023/a:1006170514174openalex-snapshot
T-Resolution: Refinements and Model Elimination
inferred← citeshttps://doi.org/10.1023/a:1008637201658openalex-snapshot
META-AMPHION: Synthesis of Efficient Domain-Specific Program Synthesis Systems
inferred← citeshttps://doi.org/10.1023/a:1008687430626openalex-snapshot
AL-log: Integrating Datalog and Description Logics
inferred← citeshttps://doi.org/10.1023/a:1008792020665openalex-snapshot
Token-Templates and Logic Programs for Intelligent Web Search
inferred← citeshttps://doi.org/10.1023/a:1022587501759openalex-snapshot
Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing
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/08839518808949905openalex-snapshot
A LOGIC PROGRAMMING APPROACH TO HYBRID KNOWLEDGE REPRESENTATION
inferred← citeshttps://doi.org/10.1080/08839519108927916openalex-snapshot
PERSPECTIVES IN KNOWLEDGE REPRESENTATION
inferred← citeshttps://doi.org/10.1093/logcom/1.5.691openalex-snapshot
Semantics-Based Translation Methods for Modal Logics
showing the first 200 of 240 · page through all 240
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.