Maria Paola Bonacina conducts research in symbolic reasoning, a field of artificial intelligence concerned with enabling computers to reason, not necessarily by imitating natural intelligence, but rather in their own way. Maria Paola's primary area is automated reasoning, where a reasoning tool is expected to produce solutions also without frequent user interaction, and logico-deductive reasoning, where logic is the representation language and deduction is the main computational mechanism. Automated reasoning has numerous applications, including the analysis, verification, and synthesis of hardware and software systems and protocols, planning, natural language understanding, computer mathematics, and education in computer science and mathematics. Automated reasoning is connected with several other fields of computer science, such as machine learning, and symbolic computation. Maria Paola's research topics include:
Maria Paola publishes research papers in international journals that cover automated reasoning, symbolic computation, artificial intelligence, and computational logic (e.g., Journal of Automated Reasoning, ACM Transactions on Computational Logic, Journal of Logic and Computation, Journal of Symbolic Computation, Information and Computation). She regularly presents papers or serves on the Program Committee of conferences such as the International Conference on Automated Deduction (CADE), the International Joint Conference on Automated Reasoning (IJCAR), and several others mostly under the umbrella of the Federated Logic Conference (FLoC).
Modules running in the period selected: 53.
Click on the module to see the timetable and course details.
Di seguito sono elencati gli eventi e gli insegnamenti di Terza Missione collegati al docente:
Topic | Description | Research area |
---|---|---|
Automated reasoning | Decision procedures for satisfiability modulo theories and assignments; Automated theorem proving; Automated model building; Reasoning about programs; Interpolation of proofs for the generation of abstractions or explanations; Strategy analysis; Distributed automated deduction; Rewriting. |
Artificial Intelligence
Knowledge representation and reasoning |
Formal software verification | Application of decision procedures for satisfiability modulo theories (SMT) and assignments (SMA) to program verification; invariant generation, interpolation of proofs, and abstraction refinement (for either model checking or static analysis) via automated theorem proving. |
Software Engineering and Formal Verification
Formal software verification |
Office | Collegial Body |
---|---|
member | Faculty Board of PhD in Computer Science - Department Computer Science |
member | Computer Science Teaching Committee - Department Computer Science |
member | Computer Science Department Council - Department Computer Science |
******** CSS e script comuni siti DOL - frase 9957 ********p>