المؤلفون: Theilig, Max-Marcel^Aff1, Liebig, Hans^Aff2, Rechenberg, Peter^Aff3, Skrotzki, Birgit, Section editor^Aff4

المساهمون: Akademischer Verein Hütte e.V., Hennecke, Manfred, editor^Aff50, Skrotzki, Birgit, editor^Aff51

المصدر: HÜTTE Band 3: Elektro- und informationstechnische Grundlagen für Ingenieure. :659-682

Degree: PhD

المؤلفون: Khatun, Ayesha, Hoque, Mohammed Moshiul

المصدر: 2017 International Conference on Electrical, Computer and Communication Engineering (ECCE) Electrical, Computer and Communication Engineering (ECCE), International Conference on. :655-661 Feb, 2017

Relation: 2017 International Conference on Electrical, Computer and Communication Engineering (ECCE)

المؤلفون: Thomas, Christoph

مصطلحات موضوعية: Finite / unique termination, Rewrite rule system, Normal form, Superposition, Inductionless induction, Endliche / eindeutige Terminierung, Knuth-Bendix Algorithmus, Normalform, Initial algebra approach, Critical pair, Abstract data type, Unification, Initiale Algebrasemantik, Knuth-Bendix Algorithm, Abstrakter Datentyp, Kritisches Paar, Unifikation, Induktionslose Induktion

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::6ea3bae562bb6fa1fef6a75530cfde06

المؤلفون: Bestehorn, Michael^Aff3

المساهمون: Knopp, Lothar^Aff1, Gnauck, Albrecht, editor^Aff2

المصدر: Systemtheorie und Modellierung von Ökosystemen. :18-32

المؤلفون: Blank, Carsten, Bruckner, Martina Chirilus, Chong, Christopher, Lescarret, Vincent, Schneider, Guido, Uecker, Hannes

المصدر: Zeitschrift für angewandte Mathematik und Physik: Journal of Applied Mathematics and PhysicsJournal de Mathématiques et de Physique appliquées. May 2008 59(3):554-557

المؤلفون: Martin Farenholtz, Beate Bollig

مصطلحات موضوعية: I.2, FOS: Computer and information sciences, Polynomial, Theoretical computer science, Relation (database), Computer Science - Artificial Intelligence, Computer science, Sentential decision diagrams, F.1.3, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Komplexitätstheorie, Theoretical Computer Science, Entscheidungsgraph, 0202 electrical engineering, electronic engineering, information engineering, Computational Complexity (cs.CC), Artificial Intelligence (cs.AI), Knowledge compilation, Complement (set theory), Negation normal form, Complexity theory, Decomposable negation normal forms, Normalform, Function (mathematics), Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), Computational Theory and Mathematics, 010201 computation theory & mathematics, Theory of computation, 020201 artificial intelligence & image processing, Boolean data type

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e230825e9c8b88139b2ce32aa456f63d

المؤلفون: Zhongxiao, Hao^{Aff1, Aff2, Aff3}, Chunlong, Yao^{Aff1, Aff2}

المصدر: Journal of Computer Science and Technology. 17(4):517-521

المؤلفون: Hartmann, Erich

المصدر: The Visual Computer: International Journal of Computer Graphics. October 2001 17(7):445-456

المؤلفون: Heimberg, Lucas

المساهمون: Schweikardt, Nicole, Kuske, Dietrich, Kreutzer, Stephan

مصطلحات موضوعية: existential-positive formulae, Feferman-Vaught decompositions, Zählquantoren, algorithms, existential formulae, lower bounds, Gaifman-Normalform, Erhaltung unter Homomorphismen, preservation theorems, counting quantifiers, Komplexität, Hanf-Lokalität, Modulo-Zählquantoren, beschränkter Grad, Erhaltungssätze, preservation under extensions, Feferman-Vaught-Zerlegungen, 004 Datenverarbeitung, Informatik, first-order logic, elementary algorithms, Modell-Theorie, Existenziell-positive Formeln, Elementare Algorithmen, Hanf-Normalform, Existenzielle Formeln, ultimately periodic, Obere Schranken, Gaifman normal form, Lokalität, modulo-counting quantifiers, Hanf normal form, upper bounds, Untere Schranken, preservation under homomorphisms, Logik erster Stufe, model theory, ST 134, Hanf-locality, normal forms, bounded degree, ultimativ periodisch, Algorithmen, Normalformen, ddc:004, Erhaltung unter Erweiterungen, complexity, Łoś-Tarski-Theorem

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::417aada2a23b229b08f14218e834e690

المؤلفون: Borm, P. E. M., Cao, R., García-Jurado, I., Méndez-Naya, L.

المصدر: Operations-Research-Spektrum: Quantitative Approaches in Management. December 1995 17(4):235-238