Concept

Answer set programming

Related publications (22)

Reactive Programming Abstractions for Complex Event Logic and Dynamic Data Dependencies

A large part of software written today is reactive. In contrast to batch mode systems, a reactive program continuously adapts itself to new input which often requires a substantial amount of engineering. Traditionally, reactive programs are implemented in ...

EPFL2013

Qualitative Spatial and Temporal Reasoning with Answer Set Programming

Jingshi Li

Representing and reasoning spatial and temporal information is a key research issue in Computer Science and Artificial Intelligence. In this paper, we introduce tools that produce three novel encodings which translate problems in qualitative spatial and te ...

2012

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Yuri Faenza, Gautier Stauffer

In this paper, we provide the first linear programming formulations for the stable set problem in claw-free graphs, together with polynomial time separation routines for those formulations (they are not compact). We then exploit one of those extended formu ...

2012

Jet: An Embedded DSL for High Performance Big Data Processing

Martin Odersky, Tiark Rompf, Vojin Jovanovic, Stefan Ackermann

Cluster computing systems today impose a trade-off between generality, performance and productivity. Hadoop and Dryad force programmers to write low level programs that are tedious to compose but easy to optimize. Systems like Dryad/LINQ and Spark allow co ...

2012

Deprecating the Observer Pattern

Martin Odersky, Tiark Rompf, Ingo Maier

Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We present an approach to gradually deprecate observers in favor of reactive programming abst ...

2010

Comfusy: A Tool for Complete Functional Synthesis

Viktor Kuncak, Mikaël Mayer, Philippe Paul Henri Suter, Ruzica Piskac

Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the general-purpose programming language Scala with (non-reactive) functional synthesi ...

Springer2010

Transactional Memory

James Richard Larus, Christos Kozyrakis

Is TM the answer for improving parallel programming? ...

ACM2008

How to Make Stream Processing More Mainstream

Marco Mattavelli

Stream processing has a long history as a way of describing and implementing speciﬁc kinds of computational processes. So far, however, it has largely remained an exotic ﬁeld of endeavor, with relatively small momentum compared to traditional von Neumann c ...

IEEE, ACM2008

Coordinating Agile Vehicles through the Model-based Execution of Temporal Plans

Thomas Léauté

Agile autonomous systems are emerging, such as unmanned aerial vehicles (UAVs), that must robustly perform tightly coordinated time-critical missions; for example, military surveillance or search-and-rescue scenarios. In the space domain, execution of temp ...

AAAI Press / The MIT Press2005

Coordinating Agile Systems through the Model-based Execution of Temporal Plans

Thomas Léauté

Massachusetts Institute of Technology (MIT)2005

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.