Diferencia entre revisiones de «Computational Logic Group»
| (No se muestran 2 ediciones intermedias de otro usuario) | |||
| Línea 1: | Línea 1: | ||
The research activities of our group in the area of [http://www.cs.miami.edu/~tptp/OverviewOfATP.html automated theorem proving] begun at the end of the eighties, mainly focused on the application of algebraic methods (Gröbner basis) to deduction in multivalued logics. | The research activities of our group in the area of [http://www.cs.miami.edu/~tptp/OverviewOfATP.html automated theorem proving] begun at the end of the eighties, mainly focused on the application of algebraic methods (Gröbner basis) to deduction in multivalued logics. | ||
| − | In the first half of the nineties, our work was centred around the [http://www-unix.mcs.anl.gov/AR/otter/ OTTER] theorem prover, [http://rewriting.loria.fr/ term rewriting systems] and [http://www. | + | In the first half of the nineties, our work was centred around the [http://www-unix.mcs.anl.gov/AR/otter/ OTTER] theorem prover, [http://rewriting.loria.fr/ term rewriting systems] and [http://www.win.tue.nl/~setalle/lp/tutorial.pdf logic programming]. |
In the second half of the nineties, we started to apply algebraic methods to the [http://www.csd.abdn.ac.uk/~apreece/Research/KQpage.html verification of knowledge-based systems]. In 1997, we begun our project to apply [http://www.afm.sbu.ac.uk/ formal methods] to the verification of [http://www-formal.stanford.edu/clt/ARS/systems.html reasoning systems]. Using [http://www.cs.utexas.edu/users/moore/acl2/ ACL2] we have developed a number of basic [[Theories|computational theories]] for automated deduction. | In the second half of the nineties, we started to apply algebraic methods to the [http://www.csd.abdn.ac.uk/~apreece/Research/KQpage.html verification of knowledge-based systems]. In 1997, we begun our project to apply [http://www.afm.sbu.ac.uk/ formal methods] to the verification of [http://www-formal.stanford.edu/clt/ARS/systems.html reasoning systems]. Using [http://www.cs.utexas.edu/users/moore/acl2/ ACL2] we have developed a number of basic [[Theories|computational theories]] for automated deduction. | ||
Revisión actual del 13:57 26 abr 2011
The research activities of our group in the area of automated theorem proving begun at the end of the eighties, mainly focused on the application of algebraic methods (Gröbner basis) to deduction in multivalued logics.
In the first half of the nineties, our work was centred around the OTTER theorem prover, term rewriting systems and logic programming.
In the second half of the nineties, we started to apply algebraic methods to the verification of knowledge-based systems. In 1997, we begun our project to apply formal methods to the verification of reasoning systems. Using ACL2 we have developed a number of basic computational theories for automated deduction.
Currently, the group is formed by seven members. Our main research interests are:
- the study of techniques allowing to increase the efficiency of the algorithms of the computational theories previously developed,
- the application of the techniques developed to the verification, with the PVS verification system, of other intelligent systems (like formal concept analysis), and
- the study of the validation of knowledge bases in complex ontologies and its applications to the Semantic Web.
During all these years, the group has been involved in several research projects with public financial support. At the same time, education in Computational Logic has been one of our major concerns.
