The workshop Computer Science Logic '90 was held at the
Max-Planck-Haus in Heidelberg, Germany, October 1-5, 1990.
It was the fourth in a series of worskhops, following CSL
'89 at the University of Kaiserslautern (see LNCS 440), CSL
'88 at the University of Duisberg (see LNCS 385), and CSL
'87 at the University of Karlsruhe (see LNCS 329). This
volume contains 24 papers, chosen by means of a review
procedure from the 35 papers presented at the workshop, some
of which were invited and some selected from a total of 89
submissions. The papers cover a wide range of topics arising
from the applications of logic to computer science.
Les mer
It was the fourth in a series of worskhops, following CSL'89 at the University of Kaiserslautern (see LNCS 440), CSL'88 at the University of Duisberg (see LNCS 385), and CSL'87 at the University of Karlsruhe (see LNCS 329).
Les mer
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.
Les mer
Springer Book Archives
Springer Book Archives
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
Les mer
Produktdetaljer
ISBN
9783540544876
Publisert
1991-09-11
Utgiver
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG; Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Høyde
233 mm
Bredde
155 mm
Aldersnivå
Research, UP, P, 05, 06
Språk
Product language
Engelsk
Format
Product format
Heftet