MEGA---the maximizing expected generalization algorithm for learning complex query concepts
ACM Transactions on Information Systems (TOIS)
Sequent forms of Herbrand theorem and their applications
Annals of Mathematics and Artificial Intelligence
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Imperative LF Meta-Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Enabling verification and conformance testing for access control model
Proceedings of the 13th ACM symposium on Access control models and technologies
A General Forward Reasoning Algorithm for Various Logic Systems with Different Formalizations
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Executing JML specifications of Java card applications: a case study
Proceedings of the 2009 ACM symposium on Applied Computing
EAFoC: enterprise architecture framework based on commonality
Journal of Computer Science and Technology
How to Produce Information About a Given Entity Using Automated Deduction Methods
Electronic Notes in Theoretical Computer Science (ENTCS)
Teaching Formal Methods for the Unconquered Territory
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Decision Procedures for Set-Valued Fields
Electronic Notes in Theoretical Computer Science (ENTCS)
Implementing a fair monodic temporal logic prover
AI Communications - Practical Aspects of Automated Reasoning
Applications of automated reasoning
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
Automated reasoning for hybrid systems: two case studies
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Reachability as derivability, finite countermodels and verification
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Disunification for ultimately periodic interpretations
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Concurrent classification of EL ontologies
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Reductio ad absurdum: planning proofs by contradiction
Reasoning, Action and Interaction in AI Theories and Systems
Possibilistic semantics for logic programs with ordered disjunction
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
A Model Checking Based Approach to Bounding Worst-Case Execution Time for Multicore Processors
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Formal foundations for situation awareness based on dependent type theory
Information Fusion
Hi-index | 0.00 |
From the Publisher:Automated reasoning has matured into one of the most advanced areas of computer science. It is used in many areas of the field, including software and hardware verification, logic and functional programming, formal methods, knowledge representation, deductive databases, and artificial intelligence. This handbook presents an overview of the fundamental ideas, techniques, and methods in automated reasoning and its applications. The material covers both theory and implementation. In addition to traditional topics, the book covers material that bridges the gap between automated reasoning and related areas. Examples include model checking, nonmonotonic reasoning, numerical constraints, description logics, and implementation of declarative programming languages. The book consists of eight parts. After an overview of the early history of automated deduction, the areas covered are reasoning methods in first-order logic; equality and other built-in theories; methods of automated reasoning using induction; higher-order logic, which is used in a number of automatic and interactive proof-development systems; automated reasoning in nonclassical logics; decidable classes and model building; and implementation-related questions.