• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type:
    
    • Article (246)
    • Miscellaneous (40)
    • Book (20)
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 3 4 5 6 7...16 Hits 41 – 60 of 306 41 Mechanized metatheory revisited Miller, Dale In: ISSN: 0168-7433 ; EISSN: 1573-0670 ; Journal of Automated Reasoning ; https://hal.inria.fr/hal-01884210 ; Journal of Automated Reasoning, Springer Verlag, 2019, 63 (3), pp.625-665. ⟨10.1007/s10817-018-9483-3⟩ (2019) BASE Show details 42 Decidable XPath Fragments in the Real World Baelde, David; Lick, Anthony; Schmitz, Sylvain In: 38th ACM Symposium on Principles of Database Systems (PODS'19) ; https://hal.inria.fr/hal-01852475 ; 38th ACM Symposium on Principles of Database Systems (PODS'19), 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩ (2019) BASE Show details 43 Ne vous moquez pas de l'oiseau moqueur : un aperçu de la logique combinatoire Haralambous, Yannis In: ISSN: 1142-2785 ; EISSN: 1760-4826 ; Quadrature ; https://hal.archives-ouvertes.fr/hal-02009937 ; Quadrature, EDP Sciences, 2019, 113, pp.22--34 ; https://www.quadrature.info/produit/numero-113/ (2019) BASE Show details 44 Boolean Algebras from Trace Automata Mansard, Alexandre In: Leibniz International Proceedings in Informatics (LIPIcs) ; 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019) ; https://hal.univ-reunion.fr/hal-03009734 ; 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), Dec 2019, Bombay, India. pp.48:1-48:15, ⟨10.4230/LIPIcs.FSTTCS.2019.48⟩ (2019) BASE Show details 45 Dag Prawitz's theory of grounds ; La théorie des grounds de Dag Prawitz Piccolomini d'Aragona, Antonio. - : HAL CCSD, 2019 In: https://hal.archives-ouvertes.fr/tel-02482320 ; Logic [math.LO]. Aix-Marseille Université (AMU); Sapienza University of Rome, 2019. English (2019) BASE Show details 46 ISNLP on AI for Education - Exploratory action 2019 : Exploratory experiments combining Information Systems and Natural Language Processing Foret, Annie In: Cominlabs days ; https://hal.inria.fr/hal-02462991 ; Cominlabs days, Nov 2019, Rennes, France (2019) BASE Show details 47 On Categorial Grammatical Inference and Logical Information Systems Foret, Annie; Béchet, Denis In: Logic and Algorithms in Computational Linguistics 2018, Series: Advances in Intelligent Systems and Computing, Volume 860 ; https://hal.inria.fr/hal-02462675 ; Logic and Algorithms in Computational Linguistics 2018, Series: Advances in Intelligent Systems and Computing, Volume 860, pp.125-153, 2019, ⟨10.1007/978-3-030-30077-7_6⟩ (2019) BASE Show details 48 Conceptual analysis of an argumentation: using argumentation schemes and the Toulmin model Garnier, Marie; Saint Dizier, Patrick In: 3rd European Conference on Argumentation - ECA 2019 ; https://hal.archives-ouvertes.fr/hal-03012575 ; 3rd European Conference on Argumentation - ECA 2019, Jun 2019, Groningen, Netherlands. pp.(electronic medium) ; http://ecargument.org/ (2019) BASE Show details 49 Computing with relations, functions, and bindings ; Calculer avec des relations, des fonctions et des lieurs Gerard, Ulysse. - : HAL CCSD, 2019 In: https://hal.archives-ouvertes.fr/tel-02414237 ; Logic in Computer Science [cs.LO]. Institut Polytechnique de Paris, 2019. English. ⟨NNT : 2019IPPAX005⟩ (2019) BASE Show details 50 Elpi: an extension language for Coq (Metaprogramming Coq in the Elpi λProlog dialect) Tassi, Enrico In: https://hal.inria.fr/hal-01637063 ; 2018 (2018) BASE Show details 51 Sequential grammars with activation and blocking of rules Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu In: 8th International Conference on Machines, Computations, and Universality (MCU 2018) ; https://hal.archives-ouvertes.fr/hal-01825162 ; 8th International Conference on Machines, Computations, and Universality (MCU 2018), Jun 2018, Fontainebleau, France. pp.51--68, ⟨10.1007/978-3-319-92402-1_3⟩ (2018) BASE Show details 52 Superposition for Lambda-Free Higher-Order Logic Bentkamp, Alexander; Cruanes, Simon; Blanchette, Jasmin Christian... In: IJCAR 2018 - 9th International Joint Conference on Automated Reasoning ; https://hal.inria.fr/hal-01904595 ; IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom (2018) BASE Show details 53 A Two-Level Approach to Generate Synthetic Argumentation Reports Saint Dizier, Patrick In: ISSN: 1946-2166 ; EISSN: 1946-2174 ; Argument and Computation ; https://hal.archives-ouvertes.fr/hal-02191823 ; Argument and Computation, Taylor & Francis, 2018, 18 years of Computational Models of Natural Argument, 9 (2), pp.137-154. ⟨10.3233/AAC-180035⟩ ; https://content.iospress.com/articles/argument-and-computation/aac035 (2018) BASE Show details 54 Type-shifting: four categories Bahramian, Hamidreza In: https://hal.archives-ouvertes.fr/hal-01728738 ; 2018 (2018) BASE Show details 55 A sequent calculus with dependent types for classical arithmetic Miquey, Étienne In: LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.inria.fr/hal-01703526 ; LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.720-729, ⟨10.1145/3209108.3209199⟩ (2018) BASE Show details 56 Verification of High-Level Transformations with Inductive Refinement Types Salim Al-Sibahi, Ahmad; Dimovski, Aleksandar,; Jensen, Thomas... In: GPCE 2018 - 17th International Conference on Generative Programming: Concepts & Experience ; https://hal.inria.fr/hal-01898058 ; GPCE 2018 - 17th International Conference on Generative Programming: Concepts & Experience, Nov 2018, Boston, United States. pp.147-160, ⟨10.1145/3278122.3278125⟩ (2018) BASE Show details 57 Measuring Linguistic Complexity: Introducing a New Categorial Metric Mirzapour, Mehdi; Prost, Jean-Philippe; Retoré, Christian In: Logic and Algorithms in Computational Linguistics 2018, Series: Advances in Intelligent Systems and Computing ; Symposium on Logic and Algorithms in Computational Linguistics (LACompLing 2018) ; https://hal.archives-ouvertes.fr/hal-02146506 ; Symposium on Logic and Algorithms in Computational Linguistics (LACompLing 2018), Aug 2018, Stockholm, Sweden. pp.95-123, ⟨10.1007/978-3-030-30077-7_5⟩ ; http://staff.math.su.se/rloukanova/LACompLing2018-web/ (2018) BASE Show details 58 L'approche logique des grammaires catégorielles : une syntaxe tournée vers la sémantique Retoré, Christian In: ISSN: 0182-5887 ; Verbum (Presses Universitaires de Nancy) ; https://hal.archives-ouvertes.fr/hal-02093509 ; Verbum (Presses Universitaires de Nancy), Université de Nancy II, 2018, XL (2), pp.237-267 (2018) BASE Show details 59 Modular Software Fault Isolation as Abstract Interpretation Besson, Frédéric; Jensen, Thomas; Lepiller, Julien In: SAS 2018 - 25th International Static Analysis Symposium ; https://hal.inria.fr/hal-01894116 ; SAS 2018 - 25th International Static Analysis Symposium, Aug 2018, Freiburg, Germany. pp.166-186, ⟨10.1007/978-3-319-99725-4_12⟩ (2018) BASE Show details 60 Non-size increasing Graph Rewriting for Natural Language Processing Bonfante, Guillaume; Guillaume, Bruno In: ISSN: 0960-1295 ; EISSN: 1469-8072 ; Mathematical Structures in Computer Science ; https://hal.inria.fr/hal-00921038 ; Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2018, 28 (08), pp.1451 - 1484. ⟨10.1017/S0960129518000178⟩ (2018) Abstract: International audience ; A very large amount of work in Natural Language Processing use tree structure as the first class citizen mathematical structures to represent linguistic structures such as parsed sentences or feature structures. However, some linguistic phenomena do not cope properly with trees: for instance, in the sentence "Max decides to leave", "Max" is the subject of the both predicates "to decide" and "to leave". Tree-based linguistic formalisms generally use some encoding to manage sentences like the previous example. In former papers, we discussed the interest to use graphs rather than trees to deal with linguistic structures and we have shown how Graph Rewriting could be used for their processing, for instance in the transformation of the sentence syntax into its semantics. Our experiments have shown that Graph Rewriting applications to Natural Language Processing do not require the full computational power of the general Graph Rewriting setting. The most important observation is that all graph vertices in the final structures are in some sense "predictable" from the input data and so, we can consider the framework of Non-size increasing Graph Rewriting. In our previous papers, we have formally described the Graph Rewriting calculus we used and our purpose here is to study the theoretical aspect of termination with respect to this calculus. In our framework, we show that uniform termination is undecidable and that non-uniform termination is decidable. We define termination techniques based on weight, we prove the termination of weighted rewriting systems and we give complexity bounds on derivation lengths for these rewriting systems. Keyword: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] URL: https://hal.inria.fr/hal-00921038v2/document https://doi.org/10.1017/S0960129518000178 https://hal.inria.fr/hal-00921038v2/file/grew.pdf https://hal.inria.fr/hal-00921038 BASE Hide details Page: 1 2 3 4 5 6 7...16

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 306 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0