Semantic-based Automated Evaluation of Company Core Competence (2009)
Simona Colucci, Eugenio Di Sciascio, Francesco M. Donini
Abstract. Core Competence evaluation is crucial for strategical choices in knowledge intensive companies. Such a process is usually manually performed by the management on the basis of subjective...
Building-Blocks Selection based on Business Processes Semantics for SAP R/3 (2009)
Francesco Di Cugno, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Eufemia Tinelli
Abstract. We present a semantic-based toolkit for the automated selection of Building-Blocks in SAP R/3, aimed at easing and improving Best Practices reusability. The automated selection process...
Semantic-Based Resource Retrieval using Non-Standard Inference Services in Description Logics (2008)
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Agnese Pinto, Azzurra Ragone
Abstract. Retrieval of resources semantically annotated is a problem that is gaining interest as more and more documents and services expose descriptions based on languages developed in the framework...
Extending Propositional Logic with Concrete Domains in Multi-issue Bilateral Negotiation (2008)
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
Abstract. We present a novel approach to knowledge-based automated one-shot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical ones. The...
Extending and Computing the Concept Covering for the Semantic Web (2008)
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
The Semantic Web [15] initiative has begun, slowly yet steadily, to revolutionize the way information is provided on the Internet. The basic idea is to structure information with the aid of markup...
Semantic-based Skill Management for Automated Task Assignment and Courseware Composition (2008)
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Azzurra Ragone
Abstract: Knowledge management is characterized by many different activities ranging from the elicitation of knowledge to its storing, sharing, maintenance, usage and creation. Skill management is...
3 Complexity of Reasoning (2008)
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different “sources of...
Semantic-based matchmaking and query refinement for B2C e-marketplaces (2008)
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Azzurra Ragone, Raffaele Rizzi
Abstract. We present an application in the framework of semantic-enabled emarketplaces aimed at fully exploiting semantics of supply/demand descriptions in B2C and C2C e-marketplaces. Distinguishing...
Systems (PODS-95) Abstract The Size of a Revised Knowledge Base (2008)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
In this paper we address a specific computational aspect of belief revision: The size of the propositional formula obtained by means of the revision of a formula with a new one. In particular, we...
Extending Datalog for Matchmaking in P2P E-Marketplaces (2008)
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
Abstract. We present an approach to matchmaking in P2P e-marketplaces, which mixes in a formal and principled way Datalog, fuzzy sets and utility theory, in order to determine most promising matches...
Francesco M. Donini, Fabio Massacci, Daniele Nardi, Riccardo Rosati
Abstract. We present a semantic tableaux calculus for propositional nonmonotonic modal logics, based on possible-worlds characterisations for nonmonotonic modal logics. This method is parametric with...
Francesco M. Donini, Fabio Massacci
We propose a tableaux calculus requiring simple exponential time for satisfiability of an ALC concept C wrt a TBox T containing general axioms of the form C v D. From correspondences with...
Verification Programs for Abduction (2007)
Paolo Liberatore, Francesco M. Donini
Abstract. We call verification the process of finding the actual explanation of a given set of manifestations. We consider an abductive setting, in which explanations are sets of assumptions. To...
Preprocessing of Intractable Problems 1 (2007)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Some computationally hard problems, like deduction in logical knowledge bases, are such that part of an instance is known well before the rest of it, and remains the same for several subsequent...
ICARUS: Intelligent Classification And Retrieval of Unlabelled Scenes (2007)
Emilio Domenicucci, Francesco M. Donini, Marco Schaerf
In this paper we present ICARUS: a tool for the creation, classification and retrieval of VRML scenes. ICARUS classifies each scene using a concept description language and uses its reasoning...
Description Logics for Image Recognition: a preliminary proposal (2007)
Eugenio Di Sciascio, Eugenio Di, Sciascio Francesco, Francesco M. Donini
sses of objects ([4, 13]) or also reverting to human assistance [5]. Reasons for these difficulty are clear: there is a gap to bridge between the low-level features obtainable by a vision algorithm...
EXPTIME Tableaux for ALC (Extended Abstract) (2007)
Guiseppe De Giacomo, Francesco M. Donini, Fabio Massacci
) Giuseppe De Giacomo 1 and Francesco M. Donini 1 and Fabio Massacci 1;2 1 Dip. Di Informatica e Sistemistica, Univ. di Roma I "La Sapienza", Italy...
Email Fdonini, Francesco M. Donini, Daniele Nardi, Riccardo Rosati
this paper we propose a concept language with an epistemic operator interpreted in terms of minimal knowledge [8, 6, 11], and we show that it provides an adequate treatment of the following features:...
Vague knowledge bases for matchmaking in P2P e-marketplaces (2007)
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketplaces. In particular...
F.M.: Vague knowledge bases for matchmaking in P2P e-marketplaces (2007)
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
Abstract. In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketplaces. In...
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach (2007)
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job...
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach (2007)
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job...
A non-monotonic approach to semantic matchmaking and request refinement in e-marketplaces (2007)
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
Abstract. We present and motivate a formal approach and algorithms for semantic matchmaking in an e-commerce framework. The proposed solution exploits nonmonotonic inferences to compute...
Automated task-oriented team composition using description logics (2005)
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Azzurra Ragone
Abstract: A logic-based approach to the semantic-based composition of task oriented teams using candidates profiles and task description is presented, in the framework of a skill management system....
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Azzurra Ragone
Abstract. Recent advances in e-learning techonologies and web services make realistic the idea that courseware for personalized e-learning can be built by dynamic composition of distributed learning...
Semantic-based approach to task assignment of individual profiles (2004)
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Marina Mongiello, Giacomo Piscitelli
Abstract: This paper is focused on the problem of skill matching in an organizational context. We endow the classical weighted bipartite graph approach with a semantic based assignment of arcs weight...
A logic-based approach for matching user profiles (2004)
Andrea Calì, Diego Calvanese, Simona Colucci, Tommaso Di Noia, Francesco M. Donini
Abstract. Several applications require the matching of user profiles, e.g., job recruitment or dating systems. In this paper we present a logical framework for specifying user profiles that allows...
A System for Principled Matchmaking in an Electronic Marketplace (2003)
Noia, Tommaso Di, Sciascio, Eugenio Di, Donini, Francesco M., Mongiello, Marina
More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, are able to semantically match demands with...
Semantic matchmaking in a p-2-p electronic marketplace (2003)
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Marina Mongiello
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are peers in the...
Abductive matchmaking using description logics (2003)
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Marina Mongiello
Motivated by the matchmaking problem in electronic marketplaces, we study abduction in Description Logics. We devise suitable definitions of the problem, and show how they can model commonsense...
A formal approach to ontology-based semantic match of skills descriptions (2003)
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Marina Mongiello, Marco Mottola
Abstract: Skills management has been recently acknowledged as one of the key factors to adequately face the increasing competitiveness between knowledge intensive companies. In this paper we present...
A system for principled matchmaking in an electronic marketplace (2003)
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Marina Mongiello
ABSTRACT: More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, can match demands with supplies in an...
Solving QBF with SMV, in (2002)
Francesco M. Donini, Bari Italia, Fabio Massacci, Povo (trento) Italia, Paolo Liberatore
The possibility of solving the Quantified Boolean Formulae (QBF) problems using the SMV system is a consequence of two wellknown theoretical results: the membership of QBF to PSPACE, and the...
EXPTIME tableaux for ALC (2000)
Francesco M. Donini, Fabio Massacci
The last years have seen two major advances in Knowledge Representation and Reasoning. First, many interesting problems (ranging from Semi-structured Data to Linguistics) were shown to be expressible...
Space Efficiency of Propositional Knowledge Representation Formalisms (2000)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
We investigate the space e#ciency of a Propositional Knowledge Representation (PKR) formalism. Intuitively, the space e#ciency of a formalism F in representing a certain piece of knowledge #, is the...
Space Efficiency of Propositional Knowledge Representation Formalisms (2000)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
We investigate the space e#ciency of a Propositional Knowledge Representation (PKR) formalism. Intuitively, the space e#ciency of a formalism F in representing a certain piece of knowledge #, is the...
EXPtime Tableaux for ALC (1999)
Fabio Massacci, Francesco M. Donini, Francesco M. Donini, Dip Ingegneria Dell'informazione
The last years have seen two major advances in Knowledge Representation and Reasoning area. First, many interesting problems (ranging from Semi-structured Data to Hybrid Logics for Linguistics) are...
Preprocessing of Intractable Problems (1999)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Some computationally hard problems --e.g., deduction in logical knowledge bases-- are such that part of an instance is known well before the rest of it, and remains the same for several subsequent...
Engineering of KR-Based Support Systems for Conceptual Modelling & Analysis (1999)
Ernesto Compatangelo, Francesco M. Donini, Giovanni Rumolo
Most of present intelligent knowledge management environments for conceptual modelling and analysis suffer, in our opinion, from mixing two representation levels: (1) a conceptual level, where...
AL-log: Integrating Datalog and Description Logics (1998)
Informatik V, F. M. Donini, M. Lenzerini, D. Nardi, A. Schaerf, Francesco M. Donini, ...
. We presentanintegrated system for knowledge representation, called AL-log, based on description logics and the deductive database language Datalog. AL-log embodies two subsystems, called structural...
A Survey on Knowledge Compilation (1998)
Marco Cadoli, Francesco M. Donini
this paper we survey recent results in knowledge compilation of propositional knowledge bases. We first define and limit the scope of such a technique, then we survey exact and approximate knowledge...
Preprocessing of intractable problems (1997)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Some computationally hard problems--e.g., deduction in logical knowledge bases-- are such that part of an instance is known well before the rest of it, and remains the same for several subsequent...
Ground Nonmonotonic Modal Logics (1997)
Francesco M. Donini, Daniele Nardi, Riccardo Rosati, Ground Nonmonotonic
In this paper we address ground logics, a family of nonmonotonic modal logics, and their usage in knowledge representation. In such a setting first-order sentences are used to represent the knowledge...
Reasoning with Behavioural Knowledge in Application Domain Models (1997)
Ernesto Compatangelo, Francesco M. Donini, Giovanni Rumolo
This paper describes an analyst-oriented approach to conceptual knowledge representation and reasoning based on description logics. The approach is introduced to model and analyse the static part of...
On Compact Representations of Propositional Circumscription (1997)
Marco Cadoli, Francesco M. Donini, Marco Schaerf
. We prove that -- unless the polynomial hierarchy collapses at the second level -- the size of a purely propositional representation of the circumscription CIRC(T ) of a propositional formula T...
Autoepistemic Description Logics (1997)
Francesco M. Donini, Daniele Nardi, Riccardo Rosati
We present Autoepistemic Description Logics (ADLs), in which the language of Description Logics is augmented with modal operators interpreted according to the nonmonotonic logic MKNF . We provide...
Autoepistemic description logics (1997)
Francesco M. Donini, Daniele Nardi, Riccardo Rosati
We present Autoepistemic Description Logics (ADLs), in which the language of Description Logics is augmented with modal operators interpreted according to the nonmonotonic logic MKNF. We provide...
On Compact Representations of Propositional Circumscription (1997)
Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri
Circumscription is a popular common-sense reasoning technique, used in the fields of Artificial Intelligence, Databases and Logic Programming. In this paper we investigate the size of representations...
A survey on knowledge compilation (1997)
Francesco M. Donini, Compilability Classes
(a) Compilation in early ’90s—from my viewpoint (b) NMR in early ’90s—again, from my viewpoint
Ground Nonmonotonic Modal Logics (1997)
DONINI, FRANCESCO M., NARDI, DANIELE, ROSATI, RICCARDO
In this paper we address ground logics, a family of nonmonotonic modal logics, and their usage in knowledge representation. In such a setting non-modal sentences are used to represent the knowledge...
Ground nonmonotonic modal logics (1997)
Francesco M. Donini, Daniele Nardi, Riccardo Rosati
In this paper we address ground logics, a family of nonmonotonic modal logics, and their usage in knowledge representation. In such a setting non-modal sentences are used to represent the knowledge...
Feasibility and unfeasibility of off-line processing (1996)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
We formally investigate the idea of processing off-line part of the inputdata in order to speed up on-line computing. In particular, we focus on off-line processing for intractable decision problems....
Comparing Space Efficiency of Propositional Knowledge Representation Formalisms (1996)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
. We investigate the space eciency of a Propositional Knowledge Representation (PKR) formalism. Informally, the space eciency of a formalism F in representing a certain piece of knowledge , is the...
Is Intractability of Non-Monotonic Reasoning a Real Drawback? (1996)
Marco Cadoli, Francesco M. Donini, Marco Schaerf
Several studies about computational complexity of non-monotonic reasoning (NMR) showed that non-monotonic inference is significantly harder than classical, monotonic inference. This contrasts with...
Comparing Space Efficiency of Propositional Knowledge Representation Formalisms (1996)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. Informally, the space efficiency of a formalism F in representing a certain piece of knowledge ff, is...
Feasibility and unfeasibility of off-line processing (1996)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
We formally investigate the idea of processing offline part of the input data in order to speed up on-line computing. In particular, we focus on off-line processing for intractable decision problems....
Is Intractability of Non-Monotonic Reasoning a Real Drawback? (1996)
Marco Cadoli, Francesco M. Donini, Marco Schaerf
Several studies about complexity of NMR showed that inferring in non-monotonic knowledge bases is significantly harder than reasoning in monotonic ones. This contrasts with the general idea that NMR...
Comparing space efficiency of propositional knowledge representation formalisms (1996)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. Informally, the space efficiency of a formalism F in representing a certain piece of knowledge α, is...
Is Intractability of Non-Monotonic Reasoning a Real Drawback? (1995)
Marco Cadoli, Francesco M. Donini, Marco Schaerf
Several studies about computational complexity of non-monotonic reasoning (NMR) showed that non-monotonic inference is significantly harder than classical, monotonic inference. This contrasts with...
The Size of a Revised Knowledge Base (1995)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
In this paper we address a specific computational aspect of belief revision: The size of the propositional formula obtained by means of the revision of a formula with a new one. In particular, we...
Ground Nonmonotonic Modal Logics for Knowledge Representation (1995)
Francesco M. Donini, Daniele Nardi, Riccardo Rosati, Prove That \pi
In this paper we discuss ground logics, a family of nonmonotonic modal logics, with the goal of using them in knowledge representation. Ground logics are based on the idea of minimizing the knowledge...
On Compact Representations of Propositional Circumscription (1995)
Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri
2 Circumscription is a popular common-sense reasoning technique, used in the fields of Artificial Intelligence, Databases and Logic Programming. In this paper we investigate the size of...
The size of a revised knowledge base (1995)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
In this paper we address a specific computational aspect of belief revision: the size of the propositional formula obtained by means of the revision of a formula with a new one. In particular, we...
Queries, Rules and Definitions as Epistemic Sentences in Concept Languages (1994)
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt, Andrea Schaerf
Concept languages have been studied in order to give a formal account of the basic features of frame-based languages. The focus of research in concept languages was initially on the semantical...
Deduction in Concept Languages: From Subsumption to Instance Checking (1994)
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf
It is a common opinion that subsumption is the central reasoning task in frame-based knowledge representation languages (or concept languages). Intuitively, a concept C subsumes another concept D if...
Deduction in Concept Languages: from Subsumption to Instance Checking (1994)
DONINI, FRANCESCO M., LENZERINI, MAURIZIO, NARDI, DANIELE, SCHAERF, ANDREA
It is a common opinion that subsumption is the central reasoning task in frame-based knowledge representation languages (or concept languages). Intuitively, a concept C subsumes another concept D if...
Decidable Reasoning in Terminological Knowledge Representation Systems (1993)
Martin Buchheit, Francesco M. Donini, Andrea Schaerf
Terminological Knowledge Representation Systems (TKRS) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a...
Decidable Reasoning in Terminological Knowledge Representation Systems (1993)
Martin Buchheit, Francesco M. Donini, Andrea Schaerf
Terminological knowledge representation systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a...
Decidable Reasoning in Terminological Knowledge Representation Systems (1993)
Martin Buchheit, Francesco M. Donini, Andrea Schaerf
Terminological knowledge representation systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a...
Decidable reasoning in terminological knowledge representation systems (1993)
Martin Buchheit, Francesco M. Donini, Andrea Schaerf
Terminological knowledge representation systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a...
The Complexity of Existential Quantification in Concept Languages (1992)
Francesco M. Donini, Bernhard Hollunder, Maurizio Lenzerini, Alberto Marchetti Spaccamela, Daniele Nardi, Werner Nutt
this paper is that subsumption and unsatisfiability in ALE are NP-hard. In fact, subsumption is shown to be NP-hard for the simpler language FLE
A Hybrid System with Datalog and Concept Languages (1991)
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf
We present a hybrid system for knowledge representation, called AL-log, based on the concept language ALC and the deductive database language Datalog. AL-log embodies two subsystems, called...
The Complexity of Concept Languages (1991)
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt
A basic feature of Terminological Knowledge Representation Systems is to represent knowledge by means of taxonomies, here called terminologies, and to provide a specialized reasoning engine to do...
DL-based Support to Domain Engineering
Ernesto Compatangelo, Francesco M. Donini, Giovanni Rumolo
this paper for the development of IKMEs explicitly deals with both representation levels at the same time. It allows the domaindependent description of concepts in terms of different syntactical...