المؤلفون: Mahmood, Y., Meier, A., Schmidt, Johannes

المصدر: ACM Transactions on Computational Logic. 24(3)

مصطلحات موضوعية: logic-based argumentation, Parameterized complexity, Schaefer's framework, Computer circuits, Knowledge based systems, Complexity class, Computational task, Consistent subset, Internal structure, Logic-based argumentations, Polynomial hierarchies, Schaefe framework, Second level, Two-dimensional, Parameterization

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-62183
https://doi.org/10.1145/3582499

المؤلفون: Oetsch, Johannes, Nieves, Juan-Carlos

المصدر: Logics in Artificial Intelligence Lecture Notes in Computer Science. :794-802

مصطلحات موضوعية: Knowledge representation, Nonmonotonic reasoning, Stable-model semantics, Temporal logic, Application programs, Digital forensics, Logic programming, Program debugging, Semantics, Classical logic, Combinatorial testing, Concurrent program, Generalisation, Non-monotonic reasoning, Polynomial hierarchies, Propositional theories, Stable model semantics, Computer circuits

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-63562

المؤلفون: Oetsch, Johannes, Seidl, Martina, Tompits, Hans, Woltran, Stefan

المصدر: ACM Transactions on Computational Logic. 22(1)

مصطلحات موضوعية: Answer-set programming, disjunctive logic programs, nonmonotonic reasoning, program equivalence, quantified Boolean logic, Application programs, Boolean functions, Computer circuits, Equivalence classes, Input output programs, Knowledge representation, Logic programming, Semantics, Temporal logic, Answer set programming, Answer set semantics, Correspondence problems, Nonmonotonic logic programs, Polynomial hierarchies, Program Verification, Prototype implementations, Quantified Boolean formulas, Program debugging

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-63561

المؤلفون: Oetsch, Johannes, Seidl, Martina, Tompits, Hans, Woltran, Stefan

المصدر: Proceedings of the 20th Workshop on Logic Programming, WLP 2006. :200-205

مصطلحات موضوعية: Formal logic, Logic programming, Semantics, Answer set, Answer-set programming, Correspondence Checking, Design issues, Equivalence notions, Linear-time, Polynomial hierarchies, Propositional logic, Computer systems programming

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-63591

المؤلفون: Mavronicolas, Marios, Monien, Burkhard, Wagner, K. W.

المساهمون: Zaroliagis C., Kontogiannis, Spyros C., Pantziou G.

المصدر: European Symposium on Algorithms, ESA 2015 ; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84951875157&doi=10.1007%2f978-3-319-24024-4_6&partnerID=40&md5=bd0920d90eab24df8895543fd620a12a ; Lect. Notes Comput. Sci.

مصطلحات موضوعية: Complex networks, Congestion Games, Boolean algebra, Boolean formulae, Boolean variables, Complexity results, Five parameters, Payoff function, Polynomial hierarchies, Rich structure

Relation: http://gnosis.library.ucy.ac.cy/handle/7/54513

الاتاحة: http://gnosis.library.ucy.ac.cy/handle/7/54513
https://doi.org/10.1007/978-3-319-24024-4_6

المؤلفون: Francesco M. Donini, Marco Schaerf, Marco Cadoli

المصدر: STACS 95 ISBN: 9783540590422
STACS

مصطلحات موضوعية: Propositional variable, Polynomial hierarchy, Discrete mathematics, Polynomial, Circumscription, Compact representation, Polynomial hierarchies, Propositional formulas, Field (mathematics), Propositional formula, Propositional representation, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computer Science::Logic in Computer Science, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b48f772a8c9d06238ad0fbde2b698140
https://doi.org/10.1007/3-540-59042-0_74