-
1
المؤلفون: Franz Baader, Deepak Kapur
مصطلحات موضوعية: description logic, congruence closure, decidability, coNP, ddc:004, Beschreibungslogik, Kongruenzschluss, Entscheidbarkeit, coNP
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5180642f9d9bfc41289ed2cc07b7187
https://tud.qucosa.de/id/qucosa:79623 -
2
المؤلفون: Voigt, Marco
المساهمون: Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft, Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft, Universität des Saarlandes, Christoph Weidenbach, Weidenbach, Christoph, Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
المصدر: Logic in Computer Science [cs.LO]. Universität des Saarlandes, 2019. English
Logic in Computer Science [cs.LO]. Universität des Saarlandes, 2019. English. ⟨NNT : ⟩مصطلحات موضوعية: classical decision problem, Mathematische Logik, Prädikatenlogik / Stufe 1, Entscheidbarkeit, 02 engineering and technology, model-checking games, fragment décidable, Presburger arithmetic, 0202 electrical engineering, electronic engineering, information engineering, arithmétique linéaire, decidable fragments of first-order logic, mathematical logic, Craig interpolation, weak dependences, Lyndon interpolation, linear rational arithmetic, first-order logic, computational complexity, Berechnungskomplexität, decidability, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, logique du premier ordre, 16. Peace & justice, decidable fragment, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, linear arithmetic, 020201 artificial intelligence & image processing, combination of theories, ddc:004, ddc:620
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bc0ae0b8482f89973e0b4e047ebf7fa
https://hal.inria.fr/tel-02406821/file/voigtphd.pdf -
3
المؤلفون: Güler, Demen
المساهمون: Lange, Klaus-Jörn (Prof. Dr.)
مصطلحات موضوعية: Computer Science::Programming Languages, Entscheidbarkeit , Formale Sprache, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), Computer Science::Formal Languages and Automata Theory
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8898519478dcc8cb5cbd51b88ea5248
https://hdl.handle.net/10900/87501 -
4
المؤلفون: Teucke, Andreas
المساهمون: Weidenbach, Christoph
مصطلحات موضوعية: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Automatisches Beweisverfahren, Entscheidbarkeit, ddc:004, ddc:620
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b14e5d4a9cc67a0f35d1174f458202f
https://hdl.handle.net/21.11116/0000-0001-8E49-E -
5
المؤلفون: Kliemann, Fritz
مصطلحات موضوعية: Presburger Arithmetik, decidable, entscheidbar, Predicata, Automatentheorie, decidability, Presburger arithmetic/ automata theory, Entscheidbarkeit
وصف الملف: ix, 153 Seiten; Illustrationen
URL الوصول: https://explore.openaire.eu/search/publication?articleId=od______3361::1f5ae06de9593ea672c505362cd9052a
-
6
المؤلفون: Doczkal, Christian
المساهمون: Smolka, Gert
مصطلحات موضوعية: Temporale Logik, Vollständigkeit, temporal logic, formal proofs, completeness, decidability, Entscheidbarkeit, ddc:004, ddc:620, Formaler Beweis
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31ac904e6196f90438709152411b924a
-
7
المؤلفون: Oliver Fernández Gil, Franz Baader
المصدر: SAC
مصطلحات موضوعية: Discrete mathematics, Class (set theory), Degree (graph theory), Computer science, subsumption, EL-concept, description logic, decidability, Computability, 0102 computer and information sciences, 02 engineering and technology, Extension (predicate logic), Function (mathematics), 01 natural sciences, Decidability, Description logic, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Subsumtion, EL-Konzept, Beschreibungslogik, Entscheidbarkeit, 020201 artificial intelligence & image processing, ddc:004, Algorithm, Membership function
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::358b029ffb6d6327bff92674db9d24a2
https://tud.qucosa.de/id/qucosa:79585 -
8
المؤلفون: Lauser, Alexander
مصطلحات موضوعية: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Theoretische Informatik , Automatentheorie , Entscheidbarkeit, Monadische Logik zweiter Stufe , Syntaktische Halbgruppe, theoretical computer science , automata theory , monadic second-order logic, decidability , syntactic semigroup
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::0434e491d0849fd22bc033905bc5f5b4
-
9
المؤلفون: Wagner, Sven
مصطلحات موضوعية: Modelltheorie [gnd], Model Theory, Algebraische Modelltheorie [gnd], Bewertungstheorie [gnd], Real Algebra, msc:03C10, Decidability, msc:16W60, msc:12J15, msc:03D60, Reelle Algebra [gnd], msc:12J10, ddc:510, Rekursionstheorie [gnd], Entscheidbarkeit [gnd], Valuation Theory, Recursion Theory
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=od_______715::cd662a6a3fe6ec45fae8f605a470e243
-
10
المؤلفون: Schwandtner, Goetz
المساهمون: Grohe, Martin, Schweikardt, Nicole, Schwentick, Thomas
مصطلحات موضوعية: Datalog, 28 Informatik, Datenverarbeitung, Komplexität, Unendliche Strukturen, Entscheidbarkeit, Complexity, Decidability, ddc:004, 004 Informatik, Infinite Structures
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5097c6c0b0b7719b3798fbe38c2b77b
http://edoc.hu-berlin.de/18452/16488
