Concept

Logique de description

Publications associées (42)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Reasoning with large ontologies stored in relational databases: The OntoMinD approach

Stefano Spaccapietra, Christine Parent

A major obstacle to the development of ontologies in support of the Semantic Web is the poor capability of current ontology techniques to handle very large ontologies, in particular regarding scalability of reasoners. This paper builds on the assumption th ...

2010

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010

Functional dependencies in OWL ABoxes

Jean Paul Calbimonte Perez

Functional Dependency (FD) has been extensively studied in database theory. Most recently there have been some works investigating the implications of extending Description Logics with functional dependencies. In particular the OWL ontology language offers ...

2009

On Set-Driven Combination of Logics and Verifiers

Viktor Kuncak

We explore the problem of automated reasoning about the non-disjoint combination of logics that share set variables and operations. We prove a general combination theorem, and apply it to show the decidability for the quantifier-free combination of formula ...

2009

TOQL: Temporal Ontology Querying Language

Nikolaos Maris

We introduce TOQL, a query language for querying time information in ontologies. TOQL is a high level query language that handles ontologies almost like relational databases. Queries are issued as SQL-like statements involving time (i.e., time points or in ...

2009

A system model for water management

André Mermoud, Colin Schenk, Bastien Roquier

Although generally accepted as a necessary step to improve water management and planning, integrated water resources management (IWRM) methodology does not provide a clear definition of what should be integrated. The various water-related issues that IWRM ...

Springer-Verlag2009

Runtime Checking for Separation Logic

Viktor Kuncak

Separation logic is a popular approach for specifying properties of recursive mutable data structures. Several existing systems verify a subclass of separation logic specifications using static analysis techniques. Checking data structure specifications du ...

Springer2008

Towards a Scientific Model Management System

Stefano Spaccapietra, José Antonio Fernandes de Macedo

Computational models of biological systems aim at accurately simulating in vivo phenomena. They have become a very powerful tool enabling scientists to study complex behavior. A side effect of their success Unfortunately exists and is observed as an increa ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Soft Discretization in a Classification Model for Modeling Adaptive Route Choice with a Fuzzy ID3 Algorithm

This study introduces a way to overcome the sensitivity of decision trees used for route choice behavior studies by using fuzzy logic while preserving the advantages of decision trees and the C4.5 algorithm, namely, comprehensibility and ease of applicatio ...

National Academy of Sciences2008

Runtime Checking for Separation Logic

Viktor Kuncak

2007