Category:LNCS 1071

From BibNetWiki

Lecture Notes in Computer Science, Volume 1071

Articles in category "LNCS 1071"

There are 19 articles in this category.

A A simple tableau system for the logic of elsewhere A tableau calculus for minimal model reasoning A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits Almost duplication free tableau calculi for propositional Lax logics C Combining many-valued and intuitionistic tableaux Cyclic connections

D Distributed modal theorem proving with KE F Fibred tableaux for multi-implication logics I Incremental theory reasoning methods for semantic tableaux Interpolation for a sequent calculus of generalized quantifiers M Minimal model generation with positive unit hyper-resolution tableaux O On sets, types, fixed points, and checkerboards On the intuitionistic force of classical search

P Proof search in intuitionistic logic based on constraint satisfaction S Sequent calculi for default and autoepistemic logics Situational calculus, linear connection proofs and STRIPS-like planning: an experimental comparison Strong normalization for all style LK010q T T-string-unification: unifying prefixes in non-classical proof methods The disconnection method: a confluent integration of unification in the analytic framework