Computer Science Logic
Springer Berlin (Verlag)
978-3-540-54487-6 (ISBN)
Egon Börger ist Professor für Informatik an der Universität Pisa (Italien) und Alexander-von-Humboldt-Forschungspreisträger.
Monadic second order logic, tree automata and forbidden minors.- On the reduction theory for average case complexity.- From prolog algebras towards WAM-A mathematical study of implementation.- A formal operational semantics for languages of type Prolog III.- Efficiency considerations on goal-directed forward chaining for logic programs.- Decision problems for tarski and presburger arithmetics extended with sets.- A fast garbage collection algorithm for WAM - based PROLOG.- A resolution variant deciding some classes of clause sets.- Subclasses of quantified boolean formulas.- Algorithmic proof with diminishing resources part 1.- Cutting plane versus frege proof systems.- RAM with compact memory: a realistic and robust model of computation.- Randomness and turing reducibility restraints.- Towards an efficient tableau proof procedure for multiple-valued logics.- Interactive proof systems: Provers, rounds, and error bounds.- Logics for belief dependence.- A generalization of stability and its application to circumscription of positive introspective knowledge.- The complexity of adaptive error-correcting codes.- Ramsey's theorem in bounded arithmetic.- Nontrivial lower bounds for some NP-problems on directed graphs.- Expansions and models of autoepistemic theories.- On the existence of fixpoints in moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle.- On the tracking of loops in automated deductions.- The gap-language-technique revisited.
Erscheint lt. Verlag | 11.9.1991 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | VIII, 402 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 233 mm |
Gewicht | 694 g |
Themenwelt | Mathematik / Informatik ► Informatik |
Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
Schlagworte | Algorithm analysis and problem complexity • Artificial Intelligence • Computational Complexity • Computer • Computer Science • formale Sprachen • Formal Languages • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Komplexität • Künstliche Intelligenz • Logic • Logik • Mathematische Logik • Programmiersprachen • Programming Languages |
ISBN-10 | 3-540-54487-9 / 3540544879 |
ISBN-13 | 978-3-540-54487-6 / 9783540544876 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich