• 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 embod- iment of non-monotonic reasoning, incorporating techniques of databases, knowledge representation, logic and constraint programming. ASP has become an appealing tool for knowledge representation and reasoning and thanks to the increasing efficiency of the implementations of ASP solvers, the field has now started to tackle the first indus- trially 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 language design, execution, and application domains for lan- guages such as Java and C++, the existing methodologies and tools that are available are generally not suitable for ASP. Therefore development tools and software engineering methodologies specifically designed for ASP are required.

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

SEA’07 is the first event in hopefully a long series of workshops. It is being 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.

Apart from the regular paper presentations, the workshop will also host the ”ASP Language Forum”. The aim of this forum is to start a general discussion on the re- quirements and specification of input, output and intermediate languages for answer set solvers and grounders.

Within these proceedings are the six papers accepted for publications by our pro- gramme committee as well as three position papers for the forum.

The programme committee and organisers wish to thank all the authors who sub- mitted papers, the forum members, all participants and everyone who contributed to the success of the workshop. We hope to see you all again at the meeting.

May 2007 Marina De Vos

Torsten Schaub Organisers SEA’07

Références

Documents relatifs

We thus present TRILL, for “Tableau Reasoner for descrIption Log- ics in proLog”, that implements a tableau algorithm and is able to return explanations for queries and

The Datalog+/– languages are derived from Datalog by allowing existentially quantified variables, equality, and the falsum in rule heads, and, at the same time, by enforcing

Probabilistic logic programing, and the ability to learn probabilistic logic programs from data, can provide an attractive approach to uncertainty reasoning and statistical

In need of a general simpler accessible integral framework to debug knowledge bases, this paper is a characterisation in terms of weak constraints both for MGAS’s and Optimal

We prove that the selective unification problem is generally undecidable for constraint logic programs, and we present a correct and complete algorithm for selective unification in

The field of logic programming and nonmonotic reasoning was born in 1991, when a number of researchers working in “the theoretical ends” of logic pro- gramming and

Therefore, this research focused on a qualitative comparison of the degree of explainability of defeasible argumentation and non-monotonic fuzzy reasoning in a real-world

In this paper we presented a DSS which exploits the Constraint Logic Program- ming paradigm and supports ontology reasoning for finding the optimal solution, given the availability