جست‌وجوی استاد و پژوهشگر

João Leiteمشاهده پروفایل

استاد

• Artificial Intelligence
• Knowledge Representation and Reasoning
• Neuro-symbolic Artificial Intelligence
• +۳ مورد دیگر

João Leite is a Professor of Computer Science at the Department of Computer Science, NOVA School of Science and Technology, NOVA University Lisbon. His career spans roles as Head of Department, Vice President of APPIA, Principal Investigator of the Intelligent Systems Group at NOVA LINCS, and Senior Visiting Fellow at CSE, UNSW, Sydney, Australia. He is an International Partner of Potassco Solutions and a member of IFIP TC-12 Artificial Intelligence. João's research focuses on Artificial Intelligence , Knowledge Representation and Reasoning , Neuro-symbolic AI , Answer-Set Programming , Argumentation Theory , and Multi-Agent Systems . 2002 : PhD in Computer Science, NOVA University Lisbon 1997 : MSc in Computer Science, NOVA University Lisbon 1994 : BSc in Electronic Engineering, University of Coimbra João's articles demonstrate a consistent focus on Answer-Set Programming (ASP), with applications in Knowledge Forgetting , Modular Reasoning , and Hybrid Knowledge Bases . His work bridges ASP with Ontologies , Multi-Context Systems , and Neural Networks , emphasizing Explainable AI and Dynamic Knowledge Evolution . Recent papers explore Provenance in Heterogeneous Systems , Efficient Reasoning with Intensional Concepts , and Stream Reasoning using neural architectures. Scientific Awards : Senior Visiting Fellow at CSE, UNSW, Sydney Award-winning collaborative project: The Politics of constraints: Discursive strategies in a three-level game João has led significant research projects such as FORGET (2018-2022) on information forgetting and RIVER (2018-2022) on knowledge-stream integration. He contributed to NEURASPACE (2022-2025) and Knowledge-Aware Cyber-Physical Systems (2015-2019). His software developments include NoHR (Hybrid Reasoning), EVOLP (Evolving Logic Programs), and SWARG (Social Abstract Argumentation Tool).

Ahmed Khalid Kadhim Kadhimمشاهده پروفایل

پژوهشگر ارشد

• Artificial Intelligence
• Machine Learning
• Hyperdimensional Computing
• +۳ مورد دیگر

Ahmed Khalid Kadhim Kadhim serves as a PhD Research Fellow at the Department of Information and Communication Technology, University of Agder (UiA), Norway. Based in office A2121 at Jon Lilletuns vei 9, 4879 Grimstad, he maintains active research contributions while pursuing doctoral studies under UiA's structured PhD program. His research centers on cutting-edge artificial intelligence methodologies, specifically investigating hyperdimensional computing applications within Tsetlin Machines. This work bridges theoretical computer science and practical machine learning, focusing on developing resource-efficient, interpretable AI systems through novel vector representations and Boolean logic frameworks. His approach emphasizes computational efficiency while maintaining model transparency—a critical advantage over traditional neural networks in constrained environments. Funded through UiA's competitive PhD Research Fellow position, his work contributes to the university's strategic research priorities in computational intelligence. Current projects explore how hyperdimensional vectors can optimize Tsetlin Machine performance in pattern recognition tasks, with potential applications in edge computing and IoT systems where processing power is limited.

• Computational Biology
• Systems Biology
• Mathematical Modeling
• +۵ مورد دیگر

Tomáš Helikar is a researcher at the Department of Mathematical and Statistical Sciences within the College of Arts and Sciences at the University of Nebraska at Omaha. His work focuses on computational modeling of biological processes, with a particular emphasis on dynamical systems and qualitative modeling frameworks. Helikar co-developed Bio-Logic Builder , a web-based tool for creating Boolean rule-based models of biological regulatory mechanisms The Cell Collective , an open platform for systems biology collaboration His research spans applications in signal transduction , cell cycle modeling , and viral replication (notably influenza A), combining mathematical formalism with biomedical inquiry. While no formal awards or student advisement information appears in the available text, Helikar's publications demonstrate strong technical expertise in discrete formalism and non-technical model construction for laboratory scientists. His work enables qualitative data conversion into Boolean expressions for simulating complex biological networks.

Radosław Klimekمشاهده پروفایل

استاد

• Formal Methods
• Software Verification
• Context-Aware Systems
• +۵ مورد دیگر

Radosław Klimek serves as a Professor at AGH University of Science and Technology in Kraków, affiliated with the Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering within the Department of Applied Computer Science . His office is located in room C-2 404, and he maintains active contact through email and office hours (Thursdays 11:00-12:00). His research centers on formal methods and software verification , with significant contributions to context-aware systems , logical specifications , and process mining . Key areas include: Deduction-based verification of behavioral models Automatic generation of logical specifications Smart environment applications for rescue operations and tourism Temporal logic applications in software engineering His work bridges theoretical computer science with practical implementations in environmental monitoring and public safety systems. His publication record demonstrates consistent output in high-impact venues, with recent focus on LLM integration for model verification (2025) and context-aware systems for forest monitoring (2024). The research trajectory shows evolution from foundational work in temporal logic (1990s) to contemporary applications in smart environments and AI-assisted verification. No scientific awards were explicitly mentioned in the source materials. Professor Klimek maintains active teaching responsibilities with defined office hours for student consultations. His research spans multiple domains including smart city infrastructure, environmental monitoring systems, and formal verification frameworks. Current projects involve context-aware systems for mountain rescue operations and police interventions, leveraging sensor networks and real-time data processing. His laboratory work focuses on contextual data modeling and deduction-based verification systems , with practical implementations in: Forest monitoring networks Intelligent queue management Tourist assistance applications Smart contract validation These projects integrate formal methods with real-world environmental and public safety challenges.

• Theoretical Computer Science
• Algorithms
• Computational Complexity
• +۴ مورد دیگر

Nutan Limaye is a Professor at the Department of Theoretical Computer Science , IT University of Copenhagen , specializing in Algorithms , Computational Complexity , and Algebraic Circuits . She actively contributes to research on polynomial complexity, quantum computation, and lower bound techniques. Key Research Areas : Algebraic Circuit Complexity, Polynomial Computation, Graph Isomorphism, Boolean Satisfiability Current Projects : FLows : Formula complexity and lower bounds (2024-2026) DIREC: OnlineAlgo : Digital research initiatives (2022-2025) BARC2 : Basic Algorithms Research Copenhagen (2024-2029) Scientific Recognition includes the FOCS Best Paper Award (2022) . Her work frequently appears in top conferences like CCC , FSTTCS , and SIGACT News , with recent collaborations in Denmark and international institutions. She contributes to public understanding through media appearances on topics like basic computer science research and BARC's initiatives .

Victor Lagerkvistمشاهده پروفایل

دانشیار

• Computational Complexity
• Constraint Satisfaction Problems (CSP)
• Theoretical Computer Science
• +۳ مورد دیگر

Victor Lagerkvist is an Associate Professor at the Department of Computer Science (IDA) , Linköping University, Sweden. He is affiliated with the Theoretical Computer Science Laboratory (TCSLAB) and the Artificial Intelligence and Integrated Computing Systems (AIICS) division. His research focuses on the algebraic method for analyzing computational complexity , particularly in constraint satisfaction problems (CSPs), SAT, and graph homomorphism problems. PhD in Computer Science (2016, Linköping University) Habilitation (2020, Linköping University) His recent work investigates fine-grained complexity , twin-width , and universal algebra to improve algorithms for NP-hard problems. Publications span topics like propositional abduction, Allen's interval algebra, and semiring-based dynamic programming. His scientific awards include the Swedish Research Council Starting Grant (2020) and the 2017 Young Researcher Prize from the Ruth and Nils-Erik Stenbäck Foundation. He supervises PhD students such as Leif Eriksson and serves as a secondary supervisor for others at Linköping University and Université de Lorraine.

• Automated Theorem Proving
• Machine Learning
• Formal Verification
• +۶ مورد دیگر

Konstantin Korovin is a Reader at the Department of Computer Science, The University of Manchester. He has held various academic roles including Senior Lecturer (2015-2023), Royal Society University Research Fellow (2007-2015), and Research Associate (2004-2007). Current research focuses on automated theorem proving , machine learning integration , and verification of hardware/software . His work includes developing systems like iProver , iProver-ML , and SMLP , which combine formal methods with ML techniques. Key contributions span non-linear constraint solving , quantified Boolean logic , and DNA computing . He has won over 20 international awards, including SMT-COMP and CASC categories. Scientific Awards : Ackermann Award, Best Thesis Prize, Best Paper at FroCoS'19, CASC and SMT-COMP prizes. He supervises PhD and postdoc researchers, with alumni working at Intel, Google, and MathWorks. His tools are applied in industry, notably by Intel for hardware optimization.

• Computer Science
• Electronic Engineering
• Integrated Circuit Testing
• +۶ مورد دیگر

Marcello Dalpasso is an Associate Professor of Computer Science at the School of Engineering, University of Padova, Italy, and a member of the Department of Information Engineering. He has held this position since 2004 after serving as a researcher and teaching assistant at the same university from 1998. Born in Ferrara, Italy (1965) Graduated with highest honors in Electronic Engineering (1990), University of Bologna PhD in Electronic Engineering and Computer Science (1994), Rome His research focuses on integrated circuit testing , fault simulation , and algorithm design . He has developed techniques for IDDQ testing , bridging fault modeling , and Boolean satisfiability applications in digital systems. Other contributions include optimization algorithms for Traveling Salesman Problem (TSP) and efficient data structures. Recent publications highlight his work on Answer Set Programming for timing analysis, Python programming education , and TSP neighborhood exploration . His research spans both theoretical and applied domains, from hardware testing to software development and computational biology. He has co-authored textbooks on Computer Networks , Software Design , and Programming in Java/Python/C++ , serving as a key contributor to educational materials in computer science.

• Partial Differential Equations
• Dynamic Systems
• Applied Analysis
• +۳ مورد دیگر

Stefanopoulos Vangelis is a Professor at the University of Patras, affiliated with the Division of Applications and Foundations of Computer Science. His research spans mathematics and computer science, focusing on theoretical and applied problems. University: University of Patras Department: Division of Applications and Foundations of Computer Science Academic Rank: Professor Research Interests: His work centers on Partial Differential Equations, Dynamic Systems, and Applied Analysis, with applications in mathematical physics, algorithmic modeling, and computational theory. Key areas include eigenvalue problems, universal series, and stability analysis. Email: vstefan@ceid.upatras.gr Office Hours: Tuesday (9:00-11:00, 10:00-11:00 when no meetings), Friday (12:00-14:00) or by appointment.

Sylvie Coste-Marquisمشاهده پروفایل

مدرس

• Knowledge Representation and Reasoning
• Artificial Intelligence
• Argumentation Frameworks
• +۵ مورد دیگر

Sylvie Coste-Marquis is a Lecturer at the Institute of Technology of Lens, part of the University of Artois. Her research focuses on knowledge representation, argumentation frameworks, and computational logic, particularly in artificial intelligence applications. PhD in Computer Science (1994) from Henri Poincaré University of Nancy Co-supervised three PhD theses on argumentation systems, QBF, and speech recognition Administrative roles: Vice-President for Digital Affairs (2016-), Project Manager (2012-2016), and Head of IT Department (2010-2013) Her work explores abstract argumentation, belief revision, and quantified Boolean formulae, with recent contributions to enforcing extensions via optimization and translating argumentation frameworks. She actively participates in program committees for top-tier conferences like IJCAI and COMMA. She has contributed to ANR projects on multi-agent argumentation, configurable product recommendation, and preference handling in combinatorial domains. Her teaching includes modules on computer systems, object-oriented design, and AI, with recognized innovations in educational methods.

Lakhdar Saisمشاهده پروفایل

استاد

• Artificial Intelligence
• Propositional satisfiability
• Quantified boolean formula
• +۴ مورد دیگر

Lakhdar Sais is a Professor of Computer Science at the Centre de Recherche en Informatique de Lens (CRIL), CNRS UMR 8188, at Université d'Artois, Faculty of Jean Perrin Sciences in Lens, France. His research focuses on search and representation problems in Artificial Intelligence, including propositional satisfiability, quantified boolean formulas, constraint programming, knowledge representation and reasoning, data mining, and AI applications in Social and Human Sciences. He has supervised numerous PhD students throughout his career, with recent students including David ING (2021-present) working on migration data knowledge extraction, and previously Ikram NEKKACHE (2021), Sofiane TOUATI (2021), and Kahina BOUCHAMA (2020). His research has been recognized with multiple awards including best paper awards at SAT'11 and ICTAI'2009, and first place in the International SAT 2009 competition. His current research projects include the ANR project HYCI (2023-2026) on Hyper-places, Crises, Migrations and Inequalities, Project ERA (2022-2025) on producing new knowledge in juvenile justice and mental health, and ANR project POSTCRYPTUM (2021-2023) on algebraic cryptanalysis for post-quantum cryptography. He has also edited the Handbook of Parallel Constraint Reasoning (Springer, 2018). Scientific Awards: Best paper award at SAT'11 for 'On freezing and reactivating learnt clauses' Best paper award at ICTAI'2009 for 'Learning for Subsumption' ManySAT - First rank at International SAT 2009 competition (Parallel Track) LySAT - Two bronze medals at International SAT 2009 competition (Sequential Track) ManySAT - First rank at SAT Race 2008 competition Professor Sais has taught numerous courses including Artificial Intelligence, Constraint Programming, Knowledge Representation and Reasoning, Expert Systems, Complexity Theory, Advanced Data Structures, Algorithmics, and Functional Programming. He has served as leader of the inference and decision process research group at CRIL (2002-2013) and as Delegate Director of the CRIL laboratory (2013-2018).

• Computational Complexity
• Algebraic Structures
• Circuit Satisfiability
• +۴ مورد دیگر

Dr. Jacek Krzaczkowski is a Lecturer in the Department of Computer Science Basics at the Faculty of Mathematics, Physics and Computer Science, Maria Curie-Skłodowska University. His research focuses on computational complexity, algebraic structures, and circuit satisfiability. Position: Lecturer Department: Computer Science Basics Key Research Areas: Computational Complexity, Equation Satisfiability, Algebraic Structures His recent work involves analyzing modular circuits, multi-valued logic systems, and equivalence problems in nilpotent and supernilpotent algebras. Scientific activity centers on satisfiability problems for algebraic structures, computational models, and algorithm optimization. Publications list includes 11 documented outputs with a focus on equation solving in algebraic systems and circuit complexity. Notable works include studies on finite automata over algebraic structures and equivalence problems in 2-nilpotent algebras. Research collaborations and citations demonstrate his contributions to theoretical computer science and mathematics. His current Hirsch index (GS Citations) is 6, with total impact factor 2.1 and SNIP 4.604.

Rolf Drechslerمشاهده پروفایل

استاد

• Formal Verification
• Quantum Computing
• RISC-V Architecture
• +۴ مورد دیگر

Rolf Drechsler is a Full Professor and Head of the Group of Computer Architecture at the University of Bremen's Institute of Computer Science since 2001, and Director of the Cyber-Physical Systems Group at DFKI Bremen since 2011. He holds an adjunct professorship at the Indian Statistical Institute and has been affiliated with Duke University. Education: Diploma (1992) and Dr. phil. nat. (1995) in Computer Science from Goethe University Frankfurt Academic Leadership: Dean of Mathematics and Computer Science Faculty (2018-2025), Vice Rector for Research (2008-2013) His research focuses on formal verification , RISC-V architectures , and quantum/in-memory computing . Recent work explores LLM integration in hardware testing and polynomial-based verification techniques. Publications from 2024-2025 span IEEE Transactions , DATE , and DAC , emphasizing automated verification , quantum circuit mapping , and LLM-driven testbench generation . Scientific Awards IEEE/ACM Best Paper Awards (2013, 2018) Berninghausen-Preis for Innovative Teaching (2018) IEEE Fellow (2015) Founder Award for Solvertec (2013) He has served on program committees for DAC, ICCAD, DATE, and founded graduate schools in Embedded Systems and System Design under Germany's Excellence Initiative.

Giuseppe Sanfilippoمشاهده پروفایل

استاد

• Probability Theory
• Conditional Events
• Mathematical Logic
• +۵ مورد دیگر

Giuseppe Sanfilippo is a Full Professor of Probability (MAT/06) in the Department of Mathematics and Computer Science at the University of Palermo, Italy. He holds the position of FULL PROFESSOR (MATH-03/B) and maintains office hours on Thursdays from 9:00 to 11:00 at DMI, Via Archirafi 34, second floor, Room 213. His academic appointments include teaching positions across multiple schools at the University of Palermo: School of Basic and Applied Sciences (Mathematics program) School of Basic and Applied Sciences (Artificial Intelligence program) Polytechnic School (Statistics for Data Analysis program) School of Basic and Applied Sciences (Computer Science program) Professor Sanfilippo's research focuses on the theoretical foundations of probability theory, particularly exploring the intersection between probability, mathematical logic, and conditional reasoning. His work centers on conditional events, coherence principles, trivalent logics, and connexive logic. He has made significant contributions to understanding the probabilistic interpretation of Aristotelian syllogisms, entropy and extropy measures, and the mathematical structures underlying compound conditionals. His research has important applications in artificial intelligence, uncertainty management, and decision theory, with over two decades of publications showing consistent development of these themes. Professor Sanfilippo has been actively involved in the academic community, organizing and participating in numerous international conferences including SUM (Scalable Uncertainty Management), ECSQARU (European Conferences on Symbolic and Quantitative Approaches to Reasoning with Uncertainty), and specialized workshops on connexive logic and probabilistic reasoning. His work bridges theoretical developments with practical applications in knowledge representation and reasoning under uncertainty, as evidenced by his extensive conference participation from 2014-2024 across Europe. He mentors students through various academic programs and has supervised numerous theses in probability theory and its applications. His teaching portfolio includes core courses such as 'Calculation of Probabilities' across Mathematics, Artificial Intelligence, Statistics for Data Analysis, and Computer Science programs, as well as specialized courses like 'Uncertain Reasoning and Probability,' reflecting his commitment to both foundational education and advanced research training. Professor Sanfilippo maintains an active research laboratory focused on probabilistic reasoning, where interdisciplinary teams explore the mathematical foundations of uncertainty and their applications in artificial intelligence and decision systems. His current research agenda includes extending coherence principles to complex conditional structures and developing scalable methods for uncertainty management in AI systems, as demonstrated by his upcoming conference chair position for SUM 2024 in Palermo.

• Quantum Computing
• Computational Complexity Theory
• Theoretical Computer Science
• +۴ مورد دیگر

Scott J Aaronson is the David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin , where he explores the theoretical foundations of quantum computing and computational complexity theory . A pioneer in the field, he has bridged quantum physics, computer science, and mathematics to clarify the capabilities and limitations of quantum computers. A summa cum laude graduate of Cornell University and holder of a PhD from UC Berkeley , Aaronson has shaped public understanding through his popular blog Shtetl-Optimized , his book Quantum Computing Since Democritus , and TED Talks. His research has established critical insights into: Quantum Supremacy : Theoretical frameworks for experimental validation without full fault tolerance Cryptographic Security : Demonstrating quantum lower bounds for collision problems Classical Complexity : The invention of algebrization as a tool for complexity class analysis Awarded the ACM Prize in Computing (2020) , ACM Fellow (2019) , and the Simons Investigator Award , his work has been recognized as foundational to the digital age. He has also mentored graduate students in quantum complexity theory, with projects advancing topics like Boson Sampling , Forrelation , and Quantum Zero-Knowledge Protocols . Scientific Awards: ACM Prize in Computing (2020) ACM Fellow (2019) Tomassoni-Chisesi Prize in Physics (2018) Simons Investigator Award (2017) Alan T. Waterman Award (2012) Aaronson’s advocacy for Deep Zionism and reflections on AI’s existential implications reflect his broader engagement with ethics and societal impact in technology.