• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
1
0
0

Texte intégral

(1)

Preface

Over the last ten years, answer set programming (ASP) has grown from a pure theo- retical knowledge representation and reasoning formalism to a computational approach with a very strong formal backing. At present, ASP is seen as the computational em- bodiment of non-monotonic reasoning incorporating techniques of databases, knowl- edge representation, logic and constraint programming. ASP has become an appeal- ing tool for knowledge representation and reasoning and thanks to the increasing effi- ciency of the implementations of ASP solvers, the field has now started to tackle many industrially-relevant applications.

Writing complex programs in any language is not an easy task, with ASP being no exception. Most of the modern popular programming languages have an abundance of tools and development methodologies to facilitate and improve the coding process.

Given the differences in for example language design, execution, and application do- mains for languages such as Java and C++, the existing methodologies and tools that are available are mostly not suitable for ASP. Therefore development tools and software engineering methodologies specifically designed for ASP are required.

The SEA’09 workshop provides an international forum to discuss all software engi- neering issues the field currently faces or in the future will experience.

SEA’09 is the second first event in hopefully a long series of workshops. The first workshop was held in Tempe, Arizona, USA as a co-located workshop of LPNMR’07, one of the leading conferences in the area of logic programming and in particular ASP.

For the second edition we have again co-located with LPNMR, this time organised in Potsdam, Germany.

Apart from the regular paper presentations, the workshop also welcomes Tran Cao Son from the New Mexico State University, US as an invited speaker. In the previous edition we organised the ”ASP Language Forum” as a starting point for a discussion on the requirements and specification of input, output and intermediate languages for answer set solvers and grounders. This edition we plan a panel on ”How to program in Answer Set Programming: Towards a Software Engineering Methodology” as a starting point for a general programming methodology for ASP.

Within these proceedings you can find the five papers that were accepted for publi- cation by our programme committee and the abstract of our invited talk together with a related paper for reference.

The programme committee and organisers wish to thank all the authors who sub- mitted papers, the panel members, the reviewers, all participants and everyone who contributed to the success of this workshop.

May 2007 Marina De Vos

Torsten Schaub Organisers SEA’07

Références

Documents relatifs

Gebser, M., Leone, N., Maratea, M., Perri, S., Ricca, F., Schaub, T.: Evaluation techniques and systems for answer set programming: a survey.. Gebser, M., Maratea, M., Ricca, F.:

Finally, if the analysis of data generated in the past and stored in the database at the time of the analysis is demanded, but this analysis intends to predict the behaviour or

In particular, Lonc and Truszczy´ nski [14] have considered the parameterized complexity of the consistency problem parameterized by a given integer k, when the input is restricted

On the one hand, one could parameterize the evaluation problem just by the number of leaves of the backdoor tree, which yields fixed-parameter tractability, but then the

We propose to extend the behavioral programming execution mechanism with on-line heuristic search in program state space that allows programmers to develop non-deterministic

This paper contributes a framework for ASP application programming which features the following concrete solutions: (i) inertial fluents for declarative reason- ing about program

In (Harrison et al. 2015), we define and axiomatize an infinitary version of that logic and show that infinitary propositional formu- las are strongly equivalent to each other if

Abstract solvers are a recently employed method to formally describe, compare and com- bine solving algorithms, where the states of computation are represented as nodes of a graph,