[apologies for multiple posts; please distribute]
-------------------------------------------------
First Call for Papers
EPIA 2011 - 15th Portuguese Conference on Artificial Intelligence
Thematic Track: COLA - COmputational Logic with Applications
October 10-13
Universidade de Lisboa, Portugal
http://epia2011.appia.pt/
== Overview ==
The development of sophisticated intelligent systems requires more
and more sound and appropriate foundations and tools, resulting in
new problems and challenges for the computational logic
practitioners. Computational logic has been widely used in complex
applications in important areas such as the Deductive Databases,
Natural Language Processing and Program Analysis, and more recently
on the Semantic Web and related Web Tools. These novel applications
have exposed the limits of existing approaches, showing the need for
research on better languages and more sophisticated implementations
of reasoning systems. The COLA thematic track of EPIA 2011 covers
the broad area of Computational Logic and its applications, with
special interest on topics related with new formalisms,
environments, languages, tools, and applications. A non-exhaustive
list of topics follows:
- Logic based knowledge representation and applications
- Declarative semantics of rule languages and applications
- Program Analysis, Program Transformation, Validation and
Verification, Debugging, Profiling
- Implementation of reasoning systems, in particular logic programming,
contextual logic programming, and tabling systems
- Abductive and Inductive Logic Programming
- Ontologies, Description Logics and integration with reasoning systems
- Reasoning with incomplete and uncertain information, including
non-monotonic reasoning as well as probabilistic and fuzzy logic
programming formalisms
- Reasoning on the Semantic Web
- Applications: Deductive Databases, Data Integration,
Natural Language, Semantic Web, and Web Tools
== Important Dates ==
Deadline for paper submission: May 10, 2011
Notification of paper acceptance: June 10, 2011
Camera-ready papers: July 1, 2011
Conference dates: October 10-13, 2011
== Submission Guidelines ==
All papers should be submitted through the conference management
website at:
http://www.easychair.org/conferences/?conf=epia2011
Papers should not exceed fifteen (15) pages in length and must be
formatted according to the information for LNCS authors. Papers must
be submitted in PDF (Adobe's Portable Document Format) format and
will not be accepted in any other format. Papers that exceed 15
pages or do not follow the LNCS guidelines risk being rejected
automatically without a review. At least one author of each
accepted paper must register for the conference. More information
about the Springer's Lecture Notes in Computer Science (LNCS) are
available on the Springer LNCS Web site
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0
The best papers (the exact number is decided by the EPIA Chairs)
will appear in the proceedings published by Springer in the LNAI
series. The remaining accepted papers will be published in a venue
TBA.
== Organizing Committee ==
Paulo Moura, Universidade da Beira Interior, Portugal
Vitor Nogueira, Universidade de Évora, Portugal
== Program Committee ==
Angelika Kimmig, K. University of Leuven, Belgium
Axel Pollers, National University of Ireland, Ireland
Bart Demoen, K. University of Leuven, Belgium
Daniel Diaz, University of Paris 1, France
David Warren, University of Stony Brook, USA
Enrico Pontelli, New Mexico State University, USA
Gopal Gupta, University of Texas at Dallas, USA
Joachim Schimpf, Monash University, Australia
João Leite, CENTRIA and Universidade Nova de Lisboa, Portugal
José Alferes, CENTRIA and Universidade Nova de Lisboa, Portugal
Paulo Gomes, Universidade de Coimbra, Portugal
Peter Robinson, University of Queensland, Australia
Roberto Bagnara, University of Parma, Italy
Salvador Abreu, Universidade de Évora, Portugal
Vítor Costa, Universidade do Porto, Portugal
== Contact Information ==
cola2011(a)di.uevora.pt
-----------------------------------------------------------------
Paulo Jorge Lopes de Moura, PhD
Assistant Professor
Dep. of Computer Science, University of Beira Interior
6201-001 Covilhã, Portugal
Office 3.18 Ext. 3276
Phone: +351 275319891 Fax: +351 275319899
Email: <mailto:pmoura(a)di.ubi.pt>
Home page: <http://www.di.ubi.pt/~pmoura>
Research: <http://logtalk.org/> Blog: <http://blog.logtalk.org/>
-----------------------------------------------------------------
[Apologies for multiple receptions]
Hello.
This is a mail just for informing that the new release
Datalog Educational System version 2.7
http://des.sourceforge.net
has been launched on January, 3rd, 2012, and ported to
Ciao Prolog 1.14.2
The most relevant enhancement in current release is the
addition of an extended relational algebra processor. It
includes all the original operators but division, and
extended operators for dealing with outer joins, duplicate
elimination, recursion, and grouping with aggregates. Syntax
follows WinRDBI [Diet01], so that in particular all of its
examples run straight on DES. Another useful improvement is
a new switchable multi-line mode, allowing entering inputs
which span over several lines. This applies to both the
command prompt and the processing of batch files, and it is
enabled with the command /multiline on. Supported SQL
language has been extended a bit with new clauses for DDL
statements, as well as for metadata information. Parsing of
Datalog and SQL files and inputs has been enhanced: it now
runs faster and appropriately handles operators. Column and
relation renamings in SQL statements have been revisited and
several issues have been solved.
A complete list of enhancements, changes and fixed bugs is
attached to the end of this message.
Please, see http://des.sourceforge.net for details.
Best regards.
=============================================================
Fernando Saenz Perez
Profesor Titular de Universidad / Associate Professor
Home Page: http://www.fdi.ucm.es/profesor/fernan
Tel: + 34 913947642. Fax: + 34 913947547
Despacho / Office: 435 (4ª planta / 4th floor)
Dept. Ingenieria del Software e Inteligencia Artificial /
Department of Software Engineering and Artificial
Intelligence
Universidad Complutense de Madrid
Facultad de Informatica
C/Profesor Jose Garcia Santesmases, s/n
E - 28040 Madrid. Spain
=============================================================
Version 2.7 of DES (released on January, 3rd, 2012)
* Enhancements:
o Extended relational algebra processor including all the
original operators but division, and extended operators
for dealing with outer joins, duplicate elimination,
recursion, and grouping with aggregates
o Multi-line input is also allowed in addition to the
current single-line input. Long inputs as typical SQL
statements can be spanned over several lines. When
multi-line is enabled with the command /multiline on,
Datalog inputs must end with a dot (.), and SQL and RA
inputs with a semicolon (;). When disabled, each line is
considered as a single (Datalog, SQL or RA) input and
ending characters are optional
o When multi-line input is enabled, remarks enclosed
between /* and */ can span over several lines and can be
nested as well
o Single-line (--) and multi-line (/**/) remarks can be
included in SQL statements at any place a separating blank
can occur
o SQL statement CREATE TABLE can include LIKE for creating
a table with the same schema as an existing one
o SQL statement DROP TABLE can include IF EXISTS clause
and can apply to a list of tables
o New (non-standard) SQL metadata statements (catalogued
under ISL, Information Schema Language):
+ SHOW TABLES; List table names. TAPI enabled
+ SHOW VIEWS; List view names. TAPI enabled
+ SHOW DATABASES; List database names. TAPI enabled
+ DESCRIBE Relation; Display schema for Relation, as
/dbschema command does. TAPI enabled
o New commands:
+ /list_tables List table names. TAPI enabled
+ /list_views List view names. TAPI enabled
+ /multiline Display whether multi-line input is enabled
+ /multiline Switch Enable or disable multi-line input
(on or off resp.)
+ /ra Switch to RA interpreter
+ /ra Query Execute an RA query
+ /referenced_relations Name Display relations directly
referenced by a foreign key in Name
+ /referenced_relations Name/Arity Display relations
directly referenced by a foreign key in Name/Arity
o Last line in a processed file must not end with a
carriage return for its processing
o Faster abolish command and drop database SQL statement
o Display of the number of consulted constraints, if any
o Exceptions during constraint checking when consulting
files are caught
o Faster parsing of Datalog rules and SQL statements
o A pivot variable that does not occur in the aggregate
relation raises a syntax error
o Views are not required to be created with given column
names
o Submitting a query or creating a view with duplicated
columns is rejected
o Language command error messages instead of just "Input
processing error"
o Improved compilation of EXISTS SQL clauses, using
Datalog built-in top/2, which allows to prune the number
of computed tuples
* Changes:
o The system prompt for Datalog language changes to the
old prompt DES>, as almost any input can be handled from
this setting. The only inputs that must explicitly
submitted to a language processor are those that can be
handled by several language processors
o Null identifiers are not wasted as eagerly as in
previous versions
o Negation algorithm et_not do not longer rely on
computations by strata
o New organization of system files:
+ des_sql_debug.pl (debugger extracted from former
des_sql.pl)
+ des_dl_debug.pl (replaces des_debug.pl), and
+ des_ra.pl (includes RA processor)
* Fixed bugs:
o Listings of SQL statements including Top-N queries
failed
o After submitting an incorrect SQL view, all of its
temporary schema was not cleaned up
o Variable names in consulted Datalog constraints were
lost
o New schema names defined in the list of local
definitions inside a WITH or ASSUME SQL statement were not
handled appropriately. Bug introduced in version 2.6
o Only one blank was allowed after a SELECT statement. Bug
introduced in version 2.6
o Operator precedence in SQL conditions and Datalog bodies
was not correctly handled (parentheses were needed to
ensure correct operator applications)
o Renamed relations could not be enclosed between
parentheses
o A renamed argument in a nested query was not visible for
the WHERE condition of its outer query
o Expressions in nested SQL queries could not be
referenced from outermost queries
o Type inference failed in some situations for equivalent
internal string types (cf. russell.sql). Bug introduced in
version 2.6
o Underscored variables in a head rule made rule assertion
fail
o The Prolog interpreter did not handle conjunctive and
disjunctive queries