| a |
| abstraction refinement | EPR-based k-induction with Counterexample Guided Abstraction Refinement |
| adaptive neural networks | Application of Adaptive Neural Networks for the Filtration of Spam |
| Answer Set Programming | An Algebra of Combined Constraint Solving |
| Artificial Intelligence | BliStr: The Blind Strategymaker |
| automated theorem proving | Breeding Theorem Proving Heuristics with Genetic Algorithms
BliStr: The Blind Strategymaker |
| Automaton constraint | Implied Constraints for Automaton Constraints |
| b |
| Bilattices | Linear Models of Computation and Program Learning |
| bioprosthetic hand | Multiclassifier System with Dynamic Model of Classifier Competence Applied to the Control of Bioprosthetic Hand |
| bitopology | Linear Models of Computation and Program Learning |
| Bounded Model Checking | EPR-based k-induction with Counterexample Guided Abstraction Refinement |
| c |
| competence measure | Multiclassifier System with Dynamic Model of Classifier Competence Applied to the Control of Bioprosthetic Hand |
| computational complexity | An Algebra of Combined Constraint Solving |
| computer games | (The Final) Countdown |
| conditionals | On Conditionals |
| conjunctive normal form | A Resolution Method for Modal Logic S5 |
| constraint decomposition | A Modelling Pearl with Sortedness Constraints |
| Constraint Modelling | A Modelling Pearl with Sortedness Constraints |
| Constraint Programming | A Modelling Pearl with Sortedness Constraints |
| constraint propagator | A Modelling Pearl with Sortedness Constraints |
| constraint satisfaction | SAT-Based Techniques for Integer Linear Constraints |
| countdown game | (The Final) Countdown |
| countdown game variants | (The Final) Countdown |
| coverage control | Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks |
| coverage preserving protocols | Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks |
| d |
| data complexity | Temporal Query Answering in DL-Lite with Negation |
| Description Logic | Foundations for the Logical Difference of EL-TBoxes |
| Description Logics | Temporal Query Answering in DL-Lite with Negation |
| DL-Lite | Temporal Query Answering in DL-Lite with Negation |
| doxastic logic | Trust, Belief and Honesty |
| e |
| energy management problem | A Genetic Algorithm based Control Strategy for the Energy Management Problem in PHEVs |
| energy optimization | Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks |
| EPR fragment | EPR-based k-induction with Counterexample Guided Abstraction Refinement |
| extended interval numbers | Linear Models of Computation and Program Learning |
| f |
| feedback information | Multiclassifier System with Dynamic Model of Classifier Competence Applied to the Control of Bioprosthetic Hand |
| Feferman-Vaught Reduction Sequences | A Uniform Approach to Incremental Automated Reasoning on Strongly Distributed Structures |
| first-order logic | EPR-based k-induction with Counterexample Guided Abstraction Refinement |
| fixpoint reasoning | Foundations for the Logical Difference of EL-TBoxes |
| fuzzy sampling | Linear Models of Computation and Program Learning |
| g |
| generalized animation | Linear Models of Computation and Program Learning |
| Genetic Algorithms | A Genetic Algorithm based Control Strategy for the Energy Management Problem in PHEVs
Breeding Theorem Proving Heuristics with Genetic Algorithms |
| Global Constraints | Implied Constraints for Automaton Constraints |
| h |
| hesitant fuzzy set | Hesitant Fuzzy MADM Approach in Optimal Selection of Investment Projects |
| heuristic search | Breeding Theorem Proving Heuristics with Genetic Algorithms |
| HOL | Metis-based Paramodulation Tactic for HOL Light |
| hybrid electric vehicle | A Genetic Algorithm based Control Strategy for the Energy Management Problem in PHEVs |
| i |
| implied constraints | Implied Constraints for Automaton Constraints |
| Incremental Automated Reasoning | A Uniform Approach to Incremental Automated Reasoning on Strongly Distributed Structures |
| information entropy | Hesitant Fuzzy MADM Approach in Optimal Selection of Investment Projects |
| k |
| k-induction | EPR-based k-induction with Counterexample Guided Abstraction Refinement |
| knowledge representation | Modeling Organic Chemistry and Planning Organic Synthesis |
| Knowledge Representation and Reasoning | An Algebra of Combined Constraint Solving |
| l |
| large-theory automated reasoning | BliStr: The Blind Strategymaker |
| Linear Integer Arithmetic | SAT-Based Techniques for Integer Linear Constraints |
| logic programming | On Conditionals |
| logical difference between ontologies | Foundations for the Logical Difference of EL-TBoxes |
| m |
| mathematical foundations | An Algebra of Combined Constraint Solving |
| mathematical programming problem | Hesitant Fuzzy MADM Approach in Optimal Selection of Investment Projects |
| maximum lifetime coverage problem | Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks |
| MESON | Metis-based Paramodulation Tactic for HOL Light |
| METIS | Metis-based Paramodulation Tactic for HOL Light |
| modal logic | Trust, Belief and Honesty |
| modal logic S5 | A Resolution Method for Modal Logic S5 |
| modular systems | An Algebra of Combined Constraint Solving |
| multi-attribute decision making | Hesitant Fuzzy MADM Approach in Optimal Selection of Investment Projects |
| multi-language constraint solving | An Algebra of Combined Constraint Solving |
| Multiclassifier system | Multiclassifier System with Dynamic Model of Classifier Competence Applied to the Control of Bioprosthetic Hand |
| n |
| negative probability | Linear Models of Computation and Program Learning |
| neural networks | Application of Adaptive Neural Networks for the Filtration of Spam |
| non-monotonic reasoning | On Conditionals |
| o |
| organic chemistry synthesis problem | Modeling Organic Chemistry and Planning Organic Synthesis |
| p |
| paramodulation | Metis-based Paramodulation Tactic for HOL Light |
| probabilistic programming | Linear Models of Computation and Program Learning |
| Proof tactics | Metis-based Paramodulation Tactic for HOL Light |
| r |
| ranking of investment projects | Hesitant Fuzzy MADM Approach in Optimal Selection of Investment Projects |
| reasoning about action | Modeling Organic Chemistry and Planning Organic Synthesis |
| resolution method | A Resolution Method for Modal Logic S5 |
| s |
| SAT solving | SAT-Based Techniques for Integer Linear Constraints |
| simulations between hypergraphs | Foundations for the Logical Difference of EL-TBoxes |
| sortedness constraints | A Modelling Pearl with Sortedness Constraints |
| Spam | Application of Adaptive Neural Networks for the Filtration of Spam |
| Spam Detection | Application of Adaptive Neural Networks for the Filtration of Spam |
| spam filtration system | Application of Adaptive Neural Networks for the Filtration of Spam |
| stable sort | A Modelling Pearl with Sortedness Constraints |
| strategy development | BliStr: The Blind Strategymaker |
| Strongly distributed systems | A Uniform Approach to Incremental Automated Reasoning on Strongly Distributed Structures |
| Syntactically Defined Translation Schemes | A Uniform Approach to Incremental Automated Reasoning on Strongly Distributed Structures |
| t |
| tableaux | Metis-based Paramodulation Tactic for HOL Light |
| Temporal Queries | Temporal Query Answering in DL-Lite with Negation |
| TOPSIS method | Hesitant Fuzzy MADM Approach in Optimal Selection of Investment Projects |
| Trust | Trust, Belief and Honesty |
| w |
| Wireless Sensor Networks | Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks |
