-
1كتاب إلكتروني
المؤلفون: Potyka, NicoAff16
المساهمون: Hutchison, David, Series EditorAff1, Kanade, Takeo, Series EditorAff2, Kittler, Josef, Series EditorAff3, Kleinberg, Jon M., Series EditorAff4, Mattern, Friedemann, Series EditorAff5, Mitchell, John C., Series EditorAff6, Naor, Moni, Series EditorAff7, Pandu Rangan, C., Series EditorAff8, Steffen, Bernhard, Series EditorAff9, Terzopoulos, Demetri, Series EditorAff10, Tygar, Doug, Series EditorAff11, Weikum, Gerhard, Series EditorAff12, Ciucci, Davide, editorAff13, Pasi, Gabriella, editorAff14, Vantaggi, Barbara, editorAff15
المصدر: Scalable Uncertainty Management : 12th International Conference, SUM 2018, Milan, Italy, October 3-5, 2018, Proceedings. 11142:212-227
-
2كتاب إلكتروني
المؤلفون: Martinez, Maria VaninaAff6, Deagustini, Cristhian Ariel DavidAff7, Aff8, Falappa, Marcelo A.Aff7, Aff8, Simari, Guillermo RicardoAff7
المساهمون: Goebel, Randy, Series editorAff1, Tanaka, Yuzuru, Series editorAff2, Wahlster, Wolfgang, Series editorAff3, Bazzan, Ana L.C., editorAff4, Pichara, Karim, editorAff5
المصدر: Advances in Artificial Intelligence -- IBERAMIA 2014 : 14th Ibero-American Conference on AI, Santiago de Chile, Chile, November 24-27, 2014, Proceedings. 8864:15-27
-
3دورية أكاديمية
لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل. -
4
المؤلفون: Loan Thi-Thuy Ho, Somjit Arch-int, Ngamnij Arch-int
المصدر: International Journal of Electrical and Computer Engineering (IJECE). 12:2944
مصطلحات موضوعية: Preferred subtheories, General Computer Science, Argumentation, Description logics, Electrical and Electronic Engineering, Inconsistency-tolerant reasoning, GeneralLiterature_MISCELLANEOUS
-
5
المؤلفون: Camille Bourgaux, Anni-Yasmin Turhan, Patrick Koopmann
المساهمون: Data, Intelligence and Graphs (DIG), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Technische Universität Dresden = Dresden University of Technology (TU Dresden), ANR-16-CE23-0007,DICOS,Découverte de schémas complexes dans les bases de connaissances(2016)
المصدر: Semantic Web – Interoperability, Usability, Applicability
Semantic Web – Interoperability, Usability, Applicability, IOS Press, 2019, ⟨10.3233/SW-180337⟩مصطلحات موضوعية: description logics, Theoretical computer science, computational complexity, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Computational complexity theory, Computer Networks and Communications, Computer science, 02 engineering and technology, Ontology (information science), Semantics, Query language, temporal query answering, Computer Science Applications, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Linear temporal logic, Description logic, 020204 information systems, inconsistency-tolerant reasoning, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Conjunctive query, Dimension (data warehouse), Information Systems
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1a7c7f5ddd8ba80f95054efe13d0311
https://hal.archives-ouvertes.fr/hal-02111428/file/SWJ2019-BouKooTur.pdf -
6دورية أكاديمية
لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل. -
7
المؤلفون: Heinrich Wansing, Norihiro Kamide
المصدر: Theoretical Computer Science. 415:1-38
مصطلحات موضوعية: Discrete mathematics, Paraconsistent logic, Natural deduction, General Computer Science, Relevance logic, Theoretical Computer Science, Normalization, Sequent calculi, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Proof theory, Natural deduction systems, Calculus, Information system, Embedding, Nelson’s paraconsistent logic N4, Cut-elimination, Sequent, Inconsistency-tolerant reasoning, Principle of explosion, Computer Science(all), Mathematics
-
8دورية أكاديمية
لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل. -
9دورية أكاديمية
لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل. -
10دورية أكاديمية
لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.