Andrea Formisano's home page... (info, teaching, publications,...)

Andrea Formisano's home page (permanently under construction....)

Contact:

Dipartimento di Matematica e Informatica
Università di Perugia
via Vanvitelli 1,
06123 Perugia, Italy
tel: +39 075 5855011
fax: +39 075 5855024
email:

My official web page at the Dipartimento di Matematica e Informatica is here.

Research key words

Automated deduction, Theory reasoning, Resolution-based theorem proving, T-resolution, Logic programming, ASP, CLP, Action languages and planning, Set theory, Decidability, Relation algebras, Rasiowa-Sikorski dual tableaux and Tableaux theorem proving.

Selected publications

A.Dovier, A.Formisano, and E.Pontelli. Multi-valued Action Languages with Constraints in CLP(FD). Theory and Practice of Logic Programming. To appear.
Key words: Action Description Languages, Knowledge Representation, Planning, Constraint Logic Programming. (BibTeX, draft.pdf)
S.Costantini and A.Formisano. Modeling preferences and conditional preferences on resource consumption and production in ASP. J. of Algorithms in Cognition, Informatics and Logic, 64(1):3-15, 2009.
Key words: Answer set programming, Non-monotonic logic programming, Preferences, Quantitative reasoning, Resource consumption and production, Language extensions. (BibTeX, draft.pdf)
S.Costantini and A.Formisano. Answer Set Programming with Resources. J. of Logic and Computation, Advance Access published November 6, 2009. doi:10.1093/logcom/exp071.
Key words: Answer set programming, Non-monotonic logic programming, Quantitative reasoning, Resource consumption and production, Language extensions. (BibTeX)
A.Dovier, A.Formisano, and E.Pontelli. An Empirical Study of Constraint Logic Programming and Answer Set Programming Solutions of Combinatorial Problems. J. of Experimental and Theoretical Artificial Intelligence, 21(2):79-121, 2009.
Key words: Declarative programming, Constraint logic programming, Answer set programming, Solvers, Benchmarking. (BibTeX, draft.pdf)
A.Capotorti and A. Formisano. Comparative uncertainty: theory and automation. Mathematical Structures in Computer Science, 18(1), 2008.
Key words: Uncertainty order relations, Qualitative uncertainty frameworks, Partial assessments, Answer set programming. (BibTeX, draft.pdf)
See also the Preference Cruncher web-pages.
A. Formisano and M. Nicolosi Asmundo. An efficient relational deductive system for propositional non-classical logics. J. of Applied Non-Classical Logics, 16(3-4), 2006.
Key words: Rasiowa-Sikorski proof systems, Relational reasoning, Non-classical logics, Dual-tableaux. (BibTeX)
See also the transIt web-pages.
A.Dovier, A.Formisano, and E.G.Omodeo. Decidability Results for Sets with Atoms.. ACM Transactions on Computational Logic (TOCL), 7(2), 2006.
Key words: Set-hyperset theories, Satisfiability problem, Syllogistics, Prenex sentences, Quantifier elimination, Unification. (BibTeX, draft.pdf)
A.Formisano, E.G.Omodeo, and A.Policriti. The axiom of elementary sets on the edge of Peircean expressibility. J. of Symbolic Logic, 70(3):953-968, 2005.
Key words: Weak set theories, N-variable (in-)expressibility, Pebble games. (BibTeX, draft.pdf)
A.Formisano, E.G.Omodeo, and A.Policriti. Three-variable statements of set-pairing. Theoretical Computer Science, 322(1):147-173, 2004.
Key words: Set theory, Calculus of binary relations, Automated reasoning, Aggregates and pairing notions, Relational expressibility. (BibTeX, draft.pdf)
D.Cantone, A.Formisano, E.G.Omodeo, and C.G.Zarba, Compiling dyadic first-order specifications into map algebra. Theoretical Computer Science, 293(2):447-475, 2003.
Key words: Algebraic logic, Quantifier elimination, Relation algebras, Automation of relational reasoning, Visual relational reasoning. (BibTeX, draft.pdf)
A.Formisano, E.G.Omodeo, and M.Temperini. Goals and Benchmarks for Automated Map Reasoning.. J. of Symbolic Computation, 29(2), pp. 259-297, February 2000.
Key words: Algebraic logic, Relation algebras, Automation of relational reasoning, First-order theorem-proving. (BibTeX, draft.pdf)
A.Formisano and A.Policriti. T-resolution: Refinements and Model Elimination. J. of Automated Reasoning, 22(4):433-483, May 1999.
Key words: Automated deduction, Theory reasoning, Model elimination, Resolution-based theorem proving, Decidability. (BibTeX, draft.pdf)

More...

...something's wrong, shut the light
heavy thoughts tonight
and they aren't of snow white...

Andrea Formisano's home page (permanently under construction....)

Contact:

Didattica A.A.2009/10 (in italian):

...e la tesi? (in italian):

A few events:

Research key words

Selected publications