This title is organized in topical sections on nonmonotonic reasoning, descriptive complexity, specification and automatic proof-assistants, theorem proving, verification, logic programming and constraint logic programming.

Nonmononic reasoning.- On the Complexity of Theory Curbing.- Descriptive complexity.- Graph Operations and Monadic Second-Order Logic: A Survey.- Efficient First Order Functional Program Interpreter with Time Bound Certifications.- Specification and automatic proof-assistants.- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System.- Behavioural Constructor Implementation for Regular Algebras.- An Extensible Proof Text Editor.- A Tactic Language for the System Coq.- Theorem proving.- Proof Simplification for Model Generation and Its Applications.- Have SPASS with OCC1N = g .- Verification.- Compiling and Verifying Security Protocols.- Equational Binary Decision Diagrams.- A PVS Proof Obligation Generator for Lustre Programs.- Logic programming and CLP.- Efficient Structural Information Analysis for Real CLP Languages.- Playing Logic Programs with the Alpha-Beta Algorithm.- Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison.- Nonclassical logics and lambda calculus.- Quantified Propositional Gödel Logics.- Proof-Search in Implicative Linear Logic as a Matching Problem.- A New Model Construction for the Polymorphic Lambda Calculus.- Church’s Lambda Delta Calculus.- Logic and databases.- Querying Inconsistent Databases.- How to Decide Query Containment under Constraints Using a Description Logic.- Program analysis.- Static Reduction Analysis for Imperative Object Oriented Languages.- An Abstract Interpretation Approach to Termination of Logic Programs.- Using an Abstract Representation to Specialize Functional Logic Programs.- Binding-Time Analysis by Constraint Solving.- Mu-calculus.- Efficient Evaluation Methods for Guarded Logics and Datalog LITE.- On the Alternation-Free Horn ?-Calculus.-Planning and reasoning about actions.- The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus.- Solving Planning Problems by Partial Deduction.- A Kripkean Semantics for Dynamic Logic Programming.

GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com