Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
— In many decision support applications it is important to guarantee the expressive power, easy formalization and interpretability of Mamdani-type fuzzy inference systems (FIS), ...
Javad Jassbi, S. H. Alavi, Paulo J. A. Serra, Rita...
Abstract. The content of most Web pages is dynamically derived from an underlying relational database. Thus, the success of the Semantic Web hinges on enabling access to relational...
Syed Hamid Tirmizi, Juan Sequeda, Daniel P. Mirank...
Ontology matching is the problem of determining correspondences between concepts, properties, and individuals of different heterogeneous ontologies. With this paper we present a n...
Mathias Niepert, Christian Meilicke, Heiner Stucke...