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] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas
| Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (VIII, 520 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Architecture, Computer Mathematical logic Computer logic Artificial Intelligence Computer System Implementation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-69353-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Call-by-value games -- LISA: A specification language based on WS2S -- Evolution as a computational engine -- Timeless games -- From action calculi to linear logic -- A sequent calculus for circumscription -- Linear lower bounds and simulations in frege systems with substitutions -- A formulation of linear logic based on dependency-relations -- Resolution and the weak pigeonhole principle -- Higher-order matching and tree automata -- A proof-theoretical investigation of Zantema's problem -- Spectra with only unary function symbols -- Classical proofs via basic logic -- Canonization for Lk-equivalence is Hard -- Full abstractness for a functional/concurrent language with higher-order value-passing -- A duality theory for quantitative semantics -- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion -- Equational axioms of test algebra -- Mona & Fido: The logic-automaton connection in practice -- Existence of reduction hierarchies -- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion -- A conjunctive logical characterization of nondeterministic linear time -- On the computational complexity of type 2 functionals -- Categories with algebraic structure -- Concurrent constraint programming and non-commutative logic -- A hierarchical approach to monadic second-order logic over graphs -- The monadic quantifier alternation hierarchy over grids and pictures -- Padding and the expressive power of existential second-order logics -- Rich ?-words and monadic second-order arithmetic -- A simple ordinal recursive normalization of Gödel's T. |
| Record Nr. | UNINA-9910144911503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas
| Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (VIII, 520 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Architecture, Computer Mathematical logic Computer logic Artificial Intelligence Computer System Implementation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-69353-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Call-by-value games -- LISA: A specification language based on WS2S -- Evolution as a computational engine -- Timeless games -- From action calculi to linear logic -- A sequent calculus for circumscription -- Linear lower bounds and simulations in frege systems with substitutions -- A formulation of linear logic based on dependency-relations -- Resolution and the weak pigeonhole principle -- Higher-order matching and tree automata -- A proof-theoretical investigation of Zantema's problem -- Spectra with only unary function symbols -- Classical proofs via basic logic -- Canonization for Lk-equivalence is Hard -- Full abstractness for a functional/concurrent language with higher-order value-passing -- A duality theory for quantitative semantics -- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion -- Equational axioms of test algebra -- Mona & Fido: The logic-automaton connection in practice -- Existence of reduction hierarchies -- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion -- A conjunctive logical characterization of nondeterministic linear time -- On the computational complexity of type 2 functionals -- Categories with algebraic structure -- Concurrent constraint programming and non-commutative logic -- A hierarchical approach to monadic second-order logic over graphs -- The monadic quantifier alternation hierarchy over grids and pictures -- Padding and the expressive power of existential second-order logics -- Rich ?-words and monadic second-order arithmetic -- A simple ordinal recursive normalization of Gödel's T. |
| Record Nr. | UNISA-996466079503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers / / edited by Leszek Pacholski, Jerzy Tiuryn
| Computer Science Logic [[electronic resource] ] : 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers / / edited by Leszek Pacholski, Jerzy Tiuryn |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XI, 553 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Mathematical logic Computer logic Artificial intelligence Theory of Computation Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Artificial Intelligence |
| ISBN | 3-540-49404-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Subtyping with singleton types -- A subtyping for the Fisher-Honsell-Mitchell lambda calculus of objects -- The Girard Translation extended with recursion -- Decidability of higher-order subtyping with intersection types -- A ?-calculus structure isomorphic to Gentzen-style sequent calculus structure -- Usability: formalising (un)definedness in typed lambda calculus -- Lambda representation of operations between different term algebras -- Semi-unification and generalizations of a particularly simple form -- A mixed linear and non-linear logic: Proofs, terms and models -- Cut free formalization of logic with finitely many variables. Part I. -- How to lie without being (easily) convicted and the lengths of proofs in propositional calculus -- Monadic second-order logic and linear orderings of finite structures -- First-order spectra with one binary predicate -- Monadic logical definability of NP-complete problems -- Logics for context-free languages -- Log-approximable minimization problems on random inputs -- Convergence and 0–1 laws for L ?,? k under arbitrary measures -- Is first order contained in an initial segment of PTIME? -- Logic programming in Tau Categories -- Reasoning and rewriting with set-relations I: Ground completeness -- Resolution games and non-liftable resolution orderings -- On existential theories of list concatenation -- Completeness of resolution for definite answers with case analysis -- Subrecursion as a basis for a feasible programming language -- A sound metalogical semantics for input/output effects -- An intuitionistic modal logic with applications to the formal verification of hardware -- Towards machine-checked compiler correctness for higher-order pure functional languages -- Powerdomains, powerstructures and fairness -- Canonical forms for data-specifications -- An algebraic view of structural induction -- On the interpretation of type theory in locally cartesian closed categories -- Algorithmic aspects of propositional tense logics -- Stratified default theories -- A homomorphism concept for ?-regularity -- Ramified recurrence and computational complexity II: Substitution and poly-space -- General form recursive equations I -- Modal logics preserving admissible for S4 inference rules -- A bounded set theory with Anti-Foundation Axiom and inductive definability. |
| Record Nr. | UNISA-996466138903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 7th Workshop, CSL '93, Swansea, United Kingdom, September 13 - 17, 1993. Selected Papers / / edited by Egon Börger, Yuri Gurevich, Karl Meinke
| Computer Science Logic [[electronic resource] ] : 7th Workshop, CSL '93, Swansea, United Kingdom, September 13 - 17, 1993. Selected Papers / / edited by Egon Börger, Yuri Gurevich, Karl Meinke |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (VIII, 336 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Mathematical logic Artificial intelligence Theory of Computation Logics and Meanings of Programs Mathematical Logic and Foundations Mathematical Logic and Formal Languages Computation by Abstract Devices Artificial Intelligence |
| ISBN | 3-540-48599-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The complexity of set constraints -- On duality for the modal ?-calculus -- Short proofs of tautologies using the schema of equivalence -- Process algebra with combinators -- Is game semantics necessary? -- The model theory of concurrency -- From semantics to rules: A machine assisted analysis -- On the reasons for average superlinear speedup in parallel backtrack search -- Negation as inconsistency in PROLOG via intuitionistic logic -- Approximable minimization problems and optimal solutions on random inputs -- Bounded-arity hierarchies in fixed-point logics -- Petri nets and the equivalence problem -- Logical aspects of set constraints -- Oracles and quantifiers -- A Horn clause that implies an undecidable set of Horn clauses -- Higher-order action calculi -- A generic strong normalization argument: Application to the Calculus of Constructions -- Data types, infinity and equality in system AF 2 -- Normalization for typed lambda calculi with explicit substitution -- Program transformation and proof transformation -- Incorporating generalized quantifiers and the least fixed point operator -- “The semantics of the C programming language”. |
| Record Nr. | UNISA-996466099903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 | ||
| ||
Computer-Aided Verification [[electronic resource] ] : 2nd Internatonal Conference, CAV '90, New Brunswick, NJ, USA, June 18-21, 1990. Proceedings / / edited by Edmund M. Clarke, Robert P. Kurshan
| Computer-Aided Verification [[electronic resource] ] : 2nd Internatonal Conference, CAV '90, New Brunswick, NJ, USA, June 18-21, 1990. Proceedings / / edited by Edmund M. Clarke, Robert P. Kurshan |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XIV, 378 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computers Computer logic Software engineering Special purpose computers Mathematical Logic and Foundations Theory of Computation Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering Special Purpose and Application-Based Systems |
| ISBN | 3-540-38394-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Temporal logic model checking: Two techniques for avoiding the state explosion problem -- Automatic verification of extensions of hardware descriptions -- Papetri : Environment for the analysis of PETRI nets -- Verifying temporal properties of sequential machines without building their state diagrams -- Formal verification of digital circuits using symbolic ternary system models -- Vectorized model checking for computation tree logic -- to a computational theory and implementation of sequential hardware equivalence -- Auto/autograph -- A data path verifier for register transfer level using temporal logic language Tokio -- The use of model checking in ATPG for sequential circuits -- Compositional design and verification of communication protocols, using labelled petri nets -- Issues arising in the analysis of L.0 -- Automated RTL verification based on predicate calculus -- On using protean to verify ISO FTAM protocol -- Quantitative temporal reasoning -- Using partial-order semantics to avoid the state explosion problem in asynchronous systems -- A stubborn attack on state explosion -- Using optimal simulations to reduce reachability graphs -- Using partial orders to improve automatic verification methods -- Compositional minimization of finite state systems -- Minimal model generation -- A context dependent equivalence relation between kripke structures -- The modular framework of computer-aided verification -- Verifying liveness properties by verifying safety properties -- Memory efficient algorithms for the verification of temporal properties -- A unified approach to the deadlock detection problem in networks of communicating finite state machines -- Branching time regular temporal logic for model checking with linear time complexity -- The algebraic feedback product of automata -- Synthesizing processes and schedulers from temporal specifications -- Task-driven supervisory control of discrete event systems -- A proof lattice-based technique for analyzing liveness of resource controllers -- Verification of a multiprocessor cache protocol using simulation relations and higher-order logic (summary) -- Computer assistance for program refinement -- Program verification by symbolic execution of hyperfinite ideal machines -- Extension of the Karp and miller procedure to lotos specifications -- An algebra for delay-insensitive circuits -- Finiteness conditions and structural construction of automata for all process algebras -- On automatically explaining bisimulation inequivalence. |
| Record Nr. | UNISA-996465650903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Concept Lattices [[electronic resource] ] : Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings / / edited by Peter Eklund
| Concept Lattices [[electronic resource] ] : Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings / / edited by Peter Eklund |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (X, 418 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Artificial intelligence Software engineering Computer science—Mathematics Information storage and retrieval Mathematical Logic and Foundations Artificial Intelligence Software Engineering Mathematical Logic and Formal Languages Discrete Mathematics in Computer Science Information Storage and Retrieval |
| ISBN |
1-280-30692-0
9786610306923 3-540-24651-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preconcept Algebras and Generalized Double Boolean Algebras -- Protoconcept Graphs: The Lattice of Conceptual Contents -- Signs and Formal Concepts -- A Mathematical Model for TOSCANA-Systems: Conceptual Data Systems -- BLID: An Application of Logical Information Systems to Bioinformatics -- Formal Concept Analysis: Its Role in Teaching Lattice Theory -- Concept Lattices for Information Visualization: Can Novices Read Line-Diagrams? -- Browsing Search Results via Formal Concept Analysis: Automatic Selection of Attributes -- Formal Concept Analysis and Semantic File Systems -- Numerical Analysis in Conceptual Systems with ToscanaJ -- Tool Support for FCA -- Automated Lattice Drawing -- Congruences of Finite Distributive Concept Algebras -- When Is a Concept Algebra Boolean? -- Background Knowledge in Concept Graphs -- Agreement Contexts in Formal Concept Analysis -- Towards a Conceptual Theory of Indistinguishable Objects -- Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies -- A First Step towards Protoconcept Exploration -- Geometry of Data Tables -- Concept Extensions and Weak Clusters Associated with Multiway Dissimilarity Measures -- Unlocking the Semantics of Roget’s Thesaurus Using Formal Concept Analysis -- FCA in Knowledge Technologies: Experiences and Opportunities -- Applying Formal Concept Analysis to Description Logics -- Machine Learning and Formal Concept Analysis -- A Comparative Study of FCA-Based Supervised Classification Algorithms -- Modelling Tacit Knowledge via Questionnaire Data -- Predicate Invention and the Revision of First-Order Concept Lattices -- The Power of Peircean Algebraic Logic (PAL) -- Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges -- AddIntent: A New Incremental Algorithm for Constructing Concept Lattices -- QuDA: Applying Formal Concept Analysis in a Data Mining Environment -- A Parallel Algorithm to Generate Formal Concepts for Large Data -- Using Concept Lattices for Requirements Reconciliation. |
| Record Nr. | UNISA-996465929403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Concept Lattices [[electronic resource] ] : Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings / / edited by Peter Eklund
| Concept Lattices [[electronic resource] ] : Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings / / edited by Peter Eklund |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (X, 418 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Artificial intelligence Software engineering Computer science—Mathematics Information storage and retrieval Mathematical Logic and Foundations Artificial Intelligence Software Engineering Mathematical Logic and Formal Languages Discrete Mathematics in Computer Science Information Storage and Retrieval |
| ISBN |
1-280-30692-0
9786610306923 3-540-24651-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preconcept Algebras and Generalized Double Boolean Algebras -- Protoconcept Graphs: The Lattice of Conceptual Contents -- Signs and Formal Concepts -- A Mathematical Model for TOSCANA-Systems: Conceptual Data Systems -- BLID: An Application of Logical Information Systems to Bioinformatics -- Formal Concept Analysis: Its Role in Teaching Lattice Theory -- Concept Lattices for Information Visualization: Can Novices Read Line-Diagrams? -- Browsing Search Results via Formal Concept Analysis: Automatic Selection of Attributes -- Formal Concept Analysis and Semantic File Systems -- Numerical Analysis in Conceptual Systems with ToscanaJ -- Tool Support for FCA -- Automated Lattice Drawing -- Congruences of Finite Distributive Concept Algebras -- When Is a Concept Algebra Boolean? -- Background Knowledge in Concept Graphs -- Agreement Contexts in Formal Concept Analysis -- Towards a Conceptual Theory of Indistinguishable Objects -- Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies -- A First Step towards Protoconcept Exploration -- Geometry of Data Tables -- Concept Extensions and Weak Clusters Associated with Multiway Dissimilarity Measures -- Unlocking the Semantics of Roget’s Thesaurus Using Formal Concept Analysis -- FCA in Knowledge Technologies: Experiences and Opportunities -- Applying Formal Concept Analysis to Description Logics -- Machine Learning and Formal Concept Analysis -- A Comparative Study of FCA-Based Supervised Classification Algorithms -- Modelling Tacit Knowledge via Questionnaire Data -- Predicate Invention and the Revision of First-Order Concept Lattices -- The Power of Peircean Algebraic Logic (PAL) -- Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges -- AddIntent: A New Incremental Algorithm for Constructing Concept Lattices -- QuDA: Applying Formal Concept Analysis in a Data Mining Environment -- A Parallel Algorithm to Generate Formal Concepts for Large Data -- Using Concept Lattices for Requirements Reconciliation. |
| Record Nr. | UNINA-9910767522303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
