| **Author/Editor** | **Year** | | **Title** | **Type** | |

| **03F05** |
| |

| |

| **0/1 polytope** |
| |

| |

| **68000 Assembler** |
| |

| |

| **Abelian groups** |
| |

| |

| **abstract interpretation** |
| |

| |

| **Agent-based systems** |
| |

| |

| **Agent systems** |
| |

| |

| **algebra** |
| |

| |

| **Algebraic Modeling** |
| |

| |

| **Algebraic Varieties.** |
| |

| **algebraische Spezifikationen** |
| |

| **algorithmic invariant theory** |
| |

| |

| **ambient logic** |
| |

| |

| **Array** |
| |

| |

| **Assume-Guarantee Reasoning** |
| |

| |

| **Atari ST** |
| |

| |

| **Automated Deduction** |
| |

| |

| **Automated Theorem Proving** |
| |

| **Automated theorem proving.** |
| |

| **automatic programming** |
| |

| **Automatic Theorem Proving** |
| |

| **Autonomous systems** |
| |

| |

| **C** |
| |

| |

| **cancellative abelian monoids** |
| |

| |

| **Chaining** |
| |

| |

| **circuit CAD** |
| |

| |

| **clauses** |
| |

| |

| **co-NP** |
| |

| |

| **Combinatorial Optimization** |
| |

| |

| **Complexity** |
| |

| |

| **complexity classes** |
| |

| |

| **Compositional Verification** |
| |

| **comprehensive Gröbner bases** |
| |

| **comprehensive SAGBI bases** |
| |

| |

| **computational linguistics** |
| |

| |

| **Computer Security** |
| |

| |

| **concurrent constraint programs** |
| |

| |

| **conservative extension** |
| |

| |

| **Constraint Logic Programs** |
| |

| |

| **constraint solving** |
| |

| |

| **constructive and modal logics** |
| |

| |

| **Context unification** |
| |

| |

| **Coq** |
| |

| |

| **correspondence problem** |
| |

| |

| **Cryptographic protocols** |
| |

| |

| **cybernetic sys tem** |
| |

| |

| **Database query languages** |
| |

| |

| **Decidability of logical theories** |
| |

| |

| **decidable first-order fragments** |
| |

| |

| **Decision complexity of logical theories** |
| |

| |

| **decision procedures** |
| |

| |

| **deduction-based program synthesis** |
| |

| |

| **deduction theorem** |
| |

| **deductive program development** |
| |

| **deductive systems** |
| |

| |

| **default logic** |
| |

| |

| **derived rules** |
| |

| |

| **Description Logics** |
| |

| |

| **direct search** |
| |

| |

| **Disconnection Calculus** |
| |

| **discrete-time hybrid systems** |
| |

| **Distributive Lattices** |
| |

| **Distributive Lattices with Operators** |
| |

| **divisible torsion-free abelian groups** |
| |

| |

| **dynamic logic** |
| |

| |

| **E-unification** |
| |

| |

| **elementary closure** |
| |

| |

| **epistemic logic** |
| |

| |

| **Equational Reasoning** |
| |

| |

| **Executable Specifications** |
| |

| |

| **fairness** |
| |

| |

| **finite failure** |
| |

| |

| **Finite Tree Automata** |
| |

| |

| **first-order logic** |
| |

| |

| **first-order theorem proving** |
| |

| |

| **First ORder Logic** |
| |

| |

| **Focal** |
| |

| |

| **formal logic** |
| |

| |

| **formal synthesis** |
| |

| |

| **formalisms for specification** |
| |

| |

| **Frame Characterization** |
| |

| |

| **functional and logic programming** |
| |

| |

| **functional semantics** |
| |

| |

| **fuzzy control** |
| |

| |

| **genetic algorithm** |
| |

| |

| **graded modal algebra** |
| |

| |

| **ground entailment** |
| |

| |

| **guarded fragment** |
| |

| |

| **hardware synthesis** |
| |

| |

| **Heuristic search planning** |
| |

| |

| **higher-order logic** |
| |

| |

| **higher-order resolution** |
| |

| |

| **Human Computer Interaction** |
| |

| |

| **Hybrid System** |
| |

| |

| **Implementation** |
| |

| |

| **independence property** |
| |

| |

| **inductive logic programming** |
| |

| |

| **inductive theorem proving** |
| |

| |

| **Inference rule** |
| |

| |

| **Instance Based Methods** |
| |

| |

| **Integer programming** |
| |

| **Interactive proof systems** |
| |

| **Internationalization** |
| |

| |

| **ISABELLE** |
| |

| |

| **KL-ONE-type knowledge representation** |
| |

| |

| **Kripke models** |
| |

| |

| **Lattice Theory** |
| |

| |

| **learning theory** |
| |

| **Linear-time temporal logic** |
| |

| **Linear Deduction** |
| |

| |

| **Liveness** |
| |

| |

| **Logic and Functional Programming** |
| |

| |

| **logic programming** |
| |

| |

| **Logic with Equality** |
| |

| |

| **Lyapunov functions** |
| |

| |

| **mathematical induction** |
| |

| |

| **meta-variable** |
| |

| |

| **metavariables** |
| |

| |

| **middle-out reasoning** |
| |

| **Mixed Integer Programming** |
| |

| **mobile computation** |
| |

| |

| **modal and temporal logics** |
| |

| |

| **modal logics** |
| |

| |

| **model computation** |
| |

| **Model Oriented Specification** |
| |

| **Modeling** |
| |

| |

| **Multi-Agent Systems** |
| |

| |

| **Narrowing** |
| |

| **natural language semantics** |
| |

| **NEXPTIME** |
| |

| |

| **non-classical logics** |
| |

| |

| **non-local clause sets** |
| |

| |

| **Non-Symmetric Completion** |
| |

| |

| **nonmonotonic logic** |
| |

| **nontrivial entailment problems** |
| |

| **NP** |
| |

| |

| **Object-Oriented Programming** |
| |

| **optimised functional translation** |
| |

| **order locality** |
| |

| |

| **Ordering restrictions** |
| |

| |

| **parametrized binomial ideals** |
| |

| |

| **partial-CAD.** |
| |

| |

| **Peirce algebra** |
| |

| |

| **permutation groups** |
| |

| |

| **Planning** |
| |

| **planning under uncertainty** |
| |

| **planning (artificial intelligence)** |
| |

| |

| **pointer verification** |
| |

| |

| **Predicate Abstraction** |
| |

| |

| **Preference-based Logic** |
| |

| |

| **Primal Partial Instantiation** |
| |

| |

| **program analysis** |
| |

| **program development rules** |
| |

| **program synthesis** |
| |

| |

| **Programmanalyse** |
| |

| |

| **Programming Languages** |
| |

| |

| **proof construction** |
| |

| |

| **proof planning system CLAM** |
| |

| |

| **proof system** |
| |

| |

| **Proof Theory** |
| |

| |

| **Pseudo-Boolean Functions** |
| |

| **Qualitative Decision Theory** |
| |

| **quantifier elimination** |
| |

| |

| **real numbers** |
| |

| |

| **record** |
| |

| |

| **Refinement** |
| |

| |

| **refutational theorem proving** |
| |

| |

| **relational grammar** |
| |

| |

| **Relaxed plan heuristic** |
| |

| |

| **Resolution** |
| |

| **Resolution-Based Instance Generation** |
| |

| **resolution decision procedures** |
| |

| **resolution theorem proving** |
| |

| **Rewriting** |
| |

| |

| **Rigid E-Unification** |
| |

| |

| **robust control** |
| |

| **safety and liveness properties** |
| |

| **satisfiability** |
| |

| |

| **Saturation** |
| |

| |

| **search problems** |
| |

| |

| **second-order quantifier elimination** |
| |

| |

| **semantics of programming languages** |
| |

| |

| **Set-based Analysis** |
| |

| **set-based program analysis** |
| |

| **Set-of-Support Deduction** |
| |

| |

| **shape analysis** |
| |

| |

| **Software Model Checking** |
| |

| |

| **sorting algorithms** |
| |

| |

| **standard resolution theorem provers** |
| |

| |

| **Statische Analyse** |
| |

| |

| **subformula property** |
| |

| |

| **superposition** |
| |

| **symbolic arithmetical reasoning** |
| |

| **Tagging** |
| |

| |

| **Temporal Logic** |
| |

| |

| **term ordering** |
| |

| |

| **Termination** |
| |

| |

| **Theorem Proving** |
| |

| **theorem proving for non-classical logics** |
| |

| **theory resolution** |
| |

| |

| **Totally Ordered Divisible Abelian Groups** |
| |

| |

| **transformation to many-sorted logic** |
| |

| |

| **translation methods** |
| |

| |

| **Tree Automata** |
| |

| |

| **Type constraints** |
| |

| |

| **Types** |
| |

| |

| **Unification** |
| |

| |

| **Update Semantics** |
| |

| |

| **verification** |
| |

| |

| **verification. theorem proving** |
| |

| |

| **weak subsumption** |
| |

| |

| **XPath** |
| |

| **{Gomory-Chvátal} cutting plane** |
| |

| **(Not Categorized)** |
| |