| The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available. The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes. -proceedings(published in time for the respective conference) -post-proceedings(consisting of thoroughly revised final full papers) -research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.) |
| Higher-Order Termination: From Kruskal to Computability Deciding Satisfiability of Positive Second Order Joinability Formulae SAT Solving for Argument Filterings Inductive Decidability Using Implicit Induction Matching Modulo Superdevelopments Application to Second-Order Matching Derivational Complexity of Knuth-Bendix Orders Revisited A Characterization of Alternating Log Time by First Order Functional Programs Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus Modular Cut-Elimination: Finding Proofs or Counterexamples An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf A Semantic Completeness Proof for TaMeD Saturation Up to Redundancy for Tableau and Sequent Calculi Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints Combining Supervaluation and Degree Based Reasoning Under Vagueness. A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes A Local System for Intuitionistic Logic CIC": Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions Reducing Nondeterminism in the Calculus of Structures .. A Relaxed Approach to Integrity and Inconsistency in Databases On Locally Checkable Properties Deciding Key Cycles for Security Protocols Automating Verification of Loops by Parallelization On Computing Fixpoints in Well-Structured Regular Model Checking with Applications to Lossy Channel Systems Verification Condition Generation Via Theorem Proving An Incremental Approach to Abstraction-Carrying Code Context-Sensitive Multivariant Assertion Checking in Modular Programs …… Author Index |
内容加载中，请稍后...
商品评论（0条）