Publication

Assembly sequence planning using case-based reasoning techniques

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

metaSMT: focus on your application and not on solver integration

Mathias Soeken, Heinz Riener

Many applications from artificial intelligence and formal methods use decision procedures as their core solving engines. In this context, automated reasoning based on Satisfiability (SAT) or Satisfiability Modulo Theories (SMT) is very effective. For a giv ...

Springer Verlag2017

Query Rewriting in RDF Stream Processing

Jean Paul Calbimonte Perez

Querying and reasoning over RDF streams are two increasingly relevant areas in the broader scope of processing structured data on the Web. While RDF Stream Processing (RSP) has focused so far on extending SPARQL for continuous query and event processing, s ...

Springer2016

Requirements for building an ontology for autonomous robots

Kamilo Andres Melo Becerra, Howard Li

Purpose - IEEE Ontologies for Robotics and Automation Working Group were divided into subgroups that were in charge of studying industrial robotics, service robotics and autonomous robotics. This paper aims to present the work in-progress developed by the ...

Emerald Group Publishing Ltd2016

Induction for SMT Solvers

Viktor Kuncak, Andrew Joseph Reynolds

Satisfiability modulo theory solvers are increasingly being used to solve quantified formulas over structures such as integers and term algebras. Quantifier instantiation combined with ground decision procedure alone is insufficient to prove many formulas ...

Springer-Verlag Berlin2015

Encoding metaknowledge for historical databases

Frédéric Kaplan

Historical knowledge is fundamentally uncertain. A given account of an historical event is typically based on a series of sources and on sequences of interpretation and reasoning based on these sources. Generally, the product of this historical research ta ...

2014

On Induction for SMT Solvers

Viktor Kuncak, Andrew Joseph Reynolds

2014

Aligning Value and Implementation in Service Design: A Systemic Approach

Gil Regev, Alain Wegmann, Arash Golnam, Philippe Laprade, Julien Ramboz

The promise of service design is to enable a service supplier to prosper by delivering continuous value to customers. This prosperity is of strategic value to the service supplier. There is value in a service for both the service supplier and its service c ...

2012

Decision Procedures for Program Synthesis and Verification

Ruzica Piskac

Decision procedures are widely used in software development and verification. The goal of this dissertation is to increase the scope of properties that can be verified using decision procedures. To achieve this goal, we identify three improvements over the ...

EPFL2011

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

In defense of large qualitative calculi

Jingshi Li

The next challenge in qualitative spatial and temporal reasoning is to develop calculi that deal with different aspects of space and time. One approach to achieve this is to combine existing calculi that cover the different aspects. This, however, can lead ...

2010