Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computer Science Logic [[electronic resource] ] : 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter
| Computer Science Logic [[electronic resource] ] : 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (IX, 439 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Mathematical logic Computer logic Algorithms Theory of Computation Software Engineering/Programming and Operating Systems Mathematical Logic and Foundations Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-47890-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A universal Turing machine -- Recursive inseparability in linear logic -- The basic logic of proofs -- Algorithmic structuring of cut-free proofs -- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions -- Linear ?-calculus and categorical models revisited -- A self-interpreter of lambda calculus having a normal form -- An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic -- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness -- Model building by resolution -- Comparative transition system semantics -- Reasoning with higher order partial functions -- Communicating evolving algebras -- On the completeness of narrowing as the operational semantics of functional logic programming -- Inductive definability with counting on finite structures -- Linear time algorithms and NP-complete problems -- The semantics of the C programming language -- A theory of classes for a functional language with effects -- Logical definability of NP-optimisation problems with monadic auxiliary predicates -- Universes in the theories of types and names -- Notes on sconing and relators -- Solving 3-satisfiability in less than 1, 579n steps -- Kleene's slash and existence of values of open terms in type theory -- Negation-complete logic programs -- Logical characterization of bounded query classes II: Polynomial-time oracle machines -- On asymptotic probabilities of monadic second order properties. |
| Record Nr. | UNISA-996466156403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter
| Computer Science Logic [[electronic resource] ] : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (VIII, 431 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Computer logic Algorithms Theory of Computation Mathematical Logic and Foundations Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-47285-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The expressive power of transitive closure and 2-way multihead automata -- Correctness proof for the WAM with types -- Model checking of persistent Petri nets -- Provability in TBLL: A decision procedure -- How to implement first order formulas in local memory machine models -- A new approach to abstract data types II computation on ADTs as ordinary computation -- A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation -- On bounded theories -- The cutting plane proof system with bounded degree of falsity -- Denotational versus declarative semantics for functional programming -- On transitive closure logic -- Some aspects of the probabilistic behavior of variants of resolution -- Safe queries in relational databases with functions -- Logical inference and polyhedral projection -- Stable logic -- A transformational methodology for proving termination of logic programs -- Plausibility logic -- Towards Kleene Algebra with recursion -- Equational specification of abstract types and combinators -- Normal forms in infinite-valued logic: The case of one variable -- A fragment of first order logic adequate for observation equivalence -- Ordinal processes in comparative concurrency semantics -- Logical semantics of modularisation -- A cut-elimination procedure designed for evaluating proofs as programs -- Minimal from classical proofs -- Quantifier hierarchies over word relations -- Complexity results for the default- and the autoepistemic logic -- On Completeness for NP via projection translations -- Control of ?-automata, Church's problem, and the emptiness problem for tree ?-automata -- Comparing the theory of representations and constructive mathematics -- Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic -- On completeness of program synthesis systems -- Proving termination for term rewriting systems. |
| Record Nr. | UNISA-996465475103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld
| Computer Science Logic [[electronic resource] ] : 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (VIII, 402 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Applied mathematics Engineering mathematics Computers Computer logic Algorithms Mathematical Logic and Foundations Applications of Mathematics Theory of Computation Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-38401-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465654103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CSL '87 [[electronic resource] ] : 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
| CSL '87 [[electronic resource] ] : 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (VIII, 348 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computer logic Computer System Implementation Logics and Meanings of Programs |
| ISBN | 3-540-45960-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Diagonalizing over deterministic polynomial time -- Resolution with feature unification -- Surjectivity for finite sets of combinators by weak reduction -- Proving finite satisfiability of deductive databases -- Is setl a suitable language for parallel programming — a theoretical approach -- Loose diagrams, semigroupoids, categories, groupoids and iteration -- Algebraic operational semantics and modula-2 -- Program verification using dynamic logic -- Induction in the elementary theory of types and names -- On the computational complexity of quantified Horn clauses -- The conjunctive complexity of quadratic boolean functions -- On type inference for object-oriented programming languages -- Optimization aspects of logical formulas -- Logic of approximation reasoning -- Deciding the path- and word-fair equivalence problem -- Learning by teams from examples with errors -- A survey of rewrite systems -- Interfacing a logic machine -- Complexity cores and hard-to-prove formulas -- On the average case complexity of backtracking for the exact-satisfiability problem -- On functions computable in nondeterministic polynomial time: Some characterizations -- Developing logic programs: Computing through normalizing -- Model theory of deductive databases -- Algorithms for propositional updates. |
| Record Nr. | UNISA-996465660503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CSL '89 [[electronic resource] ] : 3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2-6, 1989. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
| CSL '89 [[electronic resource] ] : 3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2-6, 1989. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (VIII, 444 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Software engineering Computer logic Mathematical logic Artificial Intelligence Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-47137-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Honest polynomial-time degrees of elementary recursive sets -- On the verification of modules -- A logical operational semantics of full Prolog -- Set-theoretic reductions of Hilbert's tenth problem -- The complexity of subtheories of the existential linear theory of reals -- On test classes for universal theories -- Generalizing allowedness while retaining completeness of SLDNF-resolution -- Effectively given information systems and domains -- Davis-Putnam resolution versus unrestricted resolution -- On logical descriptions of some concepts in structural complexity theory -- Algebraic operational semantics and Occam -- Propositional provability and models of weak arithmetic -- Polymorphic recursion and semi-unification -- Deciding Horn classes by hyperresolution -- ?-branching programs of bounded width -- A predicate calculus with control of derivations -- Reducibility of monotone formulas to ?-formulas -- New ways for developing proof theories for first-order multi modal logics -- On the representation of data in lambda-calculus -- A streamlined temporal completeness theorem -- A concurrent branching time temporal logic -- Semantic for abstract fairness using metric spaces -- On the average time complexity of set partitioning -- A direct proof for the completeness of SLD-resolution -- A quantifier-free completion of logic programs -- Stratification of definite clause programs and of general logic programs -- The semantics of disjunctive deductive databases -- Sequential representation of primitive recursive functions, and complexity classes. |
| Record Nr. | UNISA-996465838403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CSL'88 [[electronic resource] ] : 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
| CSL'88 [[electronic resource] ] : 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (VIII, 404 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Mathematical logic Programming languages (Electronic computers) Computer logic Combinatorics Computer System Implementation Mathematical Logic and Foundations Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-46736-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On disjunctive self-reducibility -- The knowledge representation language LLILOG -- Completeness with respect to interpretations in deterministic and nondeterministic polynomial time -- A temporal logic approach to specify and to prove properties of finite state concurrent systems -- A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods -- Characterizing complexity classes by general recursive definitions in higher types -- Size of models versus length of computations -- Boolean circuit complexity of algebraic interpolation problems -- Loop detection in propositional Prolog programs -- Numberings of R1?F -- Interval temporal logic and star-free expressions -- An interpreter with lazy evaluation for Prolog with functions -- On the complexity of the decision problem in propositional nonmonotonic logic -- Gentzen-Systems for propositional temporal logics -- Predicate inequalities as a basis for automated termination proofs for Prolog programs -- On the existence of fair schedulers -- Using finite-linear temporal logic for specifying database dynamics -- Is average superlinear speedup possible? -- Enforcement of integrity constraints in a semantic data model -- Delete operations and Horn formulas -- Integration of descriptive and procedural language constructs -- Normal forms and the complexity of computations of logic programs -- A remark on minimal polynomials of Boolean functions -- On the emptiness problem of tree automata and completeness of modal logics of programs. |
| Record Nr. | UNISA-996465728803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||