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.
Declarative Programming and Knowledge Management [[electronic resource] ] : Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 19–22, 2017, Revised Selected Papers / / edited by Dietmar Seipel, Michael Hanus, Salvador Abreu
| Declarative Programming and Knowledge Management [[electronic resource] ] : Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 19–22, 2017, Revised Selected Papers / / edited by Dietmar Seipel, Michael Hanus, Salvador Abreu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 215 p. 32 illus.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Software engineering Numerical analysis Computer logic Artificial Intelligence Programming Techniques Software Engineering Numeric Computing Logics and Meanings of Programs |
| ISBN | 3-030-00801-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constraints -- Constraint Solving on Hybrid Systems -- Run-time Analysis of Temporal Constrained Objects -- Implementation of Logical Retraction in Constraint Handling Rules with Justifications -- The Proportional Constraint and Its Pruning -- An Operational Semantics for Constraint-logic Imperative Programming -- Hypertree Decomposition: The First Step Towards Parallel Constraint Solving -- Declarative Systems -- Declarative Aspects in Explicative Data Mining for Computational Sensemaking -- An Approach for Representing Answer Sets in Natural Language -- Techniques for Efficient Lazy-Grounding ASP Solving -- Reasoning Principles and Heurstic Strategies in Modeling Human Clusters -- Functional and Logic Programming -- Concolic Testing of Functional Logic Programs -- Declarative XML Schema Validation with SWI-Prolog -- plspec - A Specification Language for Prolog Data. |
| Record Nr. | UNINA-9910349404503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Declarative Programming and Knowledge Management [[electronic resource] ] : Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 19–22, 2017, Revised Selected Papers / / edited by Dietmar Seipel, Michael Hanus, Salvador Abreu
| Declarative Programming and Knowledge Management [[electronic resource] ] : Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 19–22, 2017, Revised Selected Papers / / edited by Dietmar Seipel, Michael Hanus, Salvador Abreu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 215 p. 32 illus.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Software engineering Numerical analysis Computer logic Artificial Intelligence Programming Techniques Software Engineering Numeric Computing Logics and Meanings of Programs |
| ISBN | 3-030-00801-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constraints -- Constraint Solving on Hybrid Systems -- Run-time Analysis of Temporal Constrained Objects -- Implementation of Logical Retraction in Constraint Handling Rules with Justifications -- The Proportional Constraint and Its Pruning -- An Operational Semantics for Constraint-logic Imperative Programming -- Hypertree Decomposition: The First Step Towards Parallel Constraint Solving -- Declarative Systems -- Declarative Aspects in Explicative Data Mining for Computational Sensemaking -- An Approach for Representing Answer Sets in Natural Language -- Techniques for Efficient Lazy-Grounding ASP Solving -- Reasoning Principles and Heurstic Strategies in Modeling Human Clusters -- Functional and Logic Programming -- Concolic Testing of Functional Logic Programs -- Declarative XML Schema Validation with SWI-Prolog -- plspec - A Specification Language for Prolog Data. |
| Record Nr. | UNISA-996466199003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Deontic Logic and Normative Systems [[electronic resource] ] : 12th International Conference, DEON 2014, Ghent, Belgium, July 12-15, 2014. Proceedings / / edited by Fabrizio Cariani, Davide Grossi, Joke Meheus, Xavier Parent
| Deontic Logic and Normative Systems [[electronic resource] ] : 12th International Conference, DEON 2014, Ghent, Belgium, July 12-15, 2014. Proceedings / / edited by Fabrizio Cariani, Davide Grossi, Joke Meheus, Xavier Parent |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 273 p. 29 illus.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Artificial intelligence Computer logic Application software Computer programming Computer science—Mathematics Mathematical Logic and Formal Languages Artificial Intelligence Logics and Meanings of Programs Computer Appl. in Administrative Data Processing Programming Techniques Discrete Mathematics in Computer Science |
| ISBN | 3-319-08615-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Challenges from natural language for deontic logic -- The relationship between deontic and other types of modality: epistemic modality, imperatives, supererogatory, etc. -- The deontic paradoxes -- The modeling of normative concepts other than obligation and permission, e.g., values -- The game-theoretical aspects of deontic reasoning -- The emergence of norms -- Norms from a conversational and pragmatic point of view.- Norms and argumentation. |
| Record Nr. | UNISA-996199993203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Deontic Logic and Normative Systems [[electronic resource] ] : 12th International Conference, DEON 2014, Ghent, Belgium, July 12-15, 2014. Proceedings / / edited by Fabrizio Cariani, Davide Grossi, Joke Meheus, Xavier Parent
| Deontic Logic and Normative Systems [[electronic resource] ] : 12th International Conference, DEON 2014, Ghent, Belgium, July 12-15, 2014. Proceedings / / edited by Fabrizio Cariani, Davide Grossi, Joke Meheus, Xavier Parent |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 273 p. 29 illus.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Artificial intelligence Computer logic Application software Computer programming Computer science—Mathematics Mathematical Logic and Formal Languages Artificial Intelligence Logics and Meanings of Programs Computer Appl. in Administrative Data Processing Programming Techniques Discrete Mathematics in Computer Science |
| ISBN | 3-319-08615-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Challenges from natural language for deontic logic -- The relationship between deontic and other types of modality: epistemic modality, imperatives, supererogatory, etc. -- The deontic paradoxes -- The modeling of normative concepts other than obligation and permission, e.g., values -- The game-theoretical aspects of deontic reasoning -- The emergence of norms -- Norms from a conversational and pragmatic point of view.- Norms and argumentation. |
| Record Nr. | UNINA-9910483970403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Deontic Logic in Computer Science [[electronic resource] ] : 11th International Conference, DEON 2012, Bergen, Norway, July 16-18, 2012, Proceedings / / edited by Thomas Agotnes, Jan M. Broersen, Dag Elgesem
| Deontic Logic in Computer Science [[electronic resource] ] : 11th International Conference, DEON 2012, Bergen, Norway, July 16-18, 2012, Proceedings / / edited by Thomas Agotnes, Jan M. Broersen, Dag Elgesem |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XII, 215 p. 21 illus.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Artificial intelligence Computer logic Application software Computer programming Computer science—Mathematics Mathematical Logic and Formal Languages Artificial Intelligence Logics and Meanings of Programs Computer Appl. in Administrative Data Processing Programming Techniques Discrete Mathematics in Computer Science |
| ISBN | 3-642-31570-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465323403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil |
| Autore | Bordihn Henning |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (211 pages) |
| Disciplina | 005.131 |
| Altri autori (Persone) |
TranNicholas
VaszilGyörgy |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer engineering Computer networks Artificial intelligence Computer Science Logic and Foundations of Programming Computer Engineering and Networks Artificial Intelligence |
| ISBN | 3-031-34326-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe’s Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words. |
| Record Nr. | UNINA-9910734866203321 |
Bordihn Henning
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings / / edited by Henning Bordihn, Nicholas Tran, György Vaszil |
| Autore | Bordihn Henning |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (211 pages) |
| Disciplina | 005.131 |
| Altri autori (Persone) |
TranNicholas
VaszilGyörgy |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer engineering Computer networks Artificial intelligence Computer Science Logic and Foundations of Programming Computer Engineering and Networks Artificial Intelligence |
| ISBN | 3-031-34326-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe’s Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words. |
| Record Nr. | UNISA-996538665803316 |
|
Bordihn Henning
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (210 pages) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer Science Logic and Foundations of Programming |
| ISBN | 3-030-93489-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity issues for the iterated h-preorders -- On the Uniform Distribution of Regular Expressions -- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets -- Sync-Maximal Permutation Groups Equal Primitive Permutation Groups -- Commutative Regular Languages with Product-Form Minimal Automata -- State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages -- More on the Descriptional Complexity of Compositions of Finite Automata -- Width Measures of Alternating Finite Automata -- Partial Derivative Automaton by Compressing Regular Expressions -- State Complexity of Partial Word Finite Automata -- State complexity of union and intersection on graph-walking automata -- Gray cycles of maximum length related to $k$-character substitutions -- Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems -- Disambiguation of Weighted Tree Automata -- Image-Binary Automata -- Improved constructions for succinct affine automata. |
| Record Nr. | UNINA-9910520061803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (210 pages) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer Science Logic and Foundations of Programming |
| ISBN | 3-030-93489-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity issues for the iterated h-preorders -- On the Uniform Distribution of Regular Expressions -- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets -- Sync-Maximal Permutation Groups Equal Primitive Permutation Groups -- Commutative Regular Languages with Product-Form Minimal Automata -- State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages -- More on the Descriptional Complexity of Compositions of Finite Automata -- Width Measures of Alternating Finite Automata -- Partial Derivative Automaton by Compressing Regular Expressions -- State Complexity of Partial Word Finite Automata -- State complexity of union and intersection on graph-walking automata -- Gray cycles of maximum length related to $k$-character substitutions -- Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems -- Disambiguation of Weighted Tree Automata -- Image-Binary Automata -- Improved constructions for succinct affine automata. |
| Record Nr. | UNISA-996464397103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings / / edited by Jürgensen, Rogério Reis
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings / / edited by Jürgensen, Rogério Reis |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 289 p. 56 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
| ISBN | 3-642-39310-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465389803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
