 | |
This workshop deals with paraconsistency and its relationship to
computational logic. The "ex falso quodlibet" rule of classical logic
predicts that everything (i.e., nothing useful at all) would follow
from the least bit of inconsistency. Although logical data consistency
is a requirement of high priority in all of computing, 100% consistency
is almost never given in practice. Taking logic seriously, this means
nothing less than a complete mismatch of theory and practice, which
in fact profoundly challenges the legitimacy of logical foundations
of computing in general. Paraconsistent logic offers a way out of
this dilemma. Unlike classical logic, paraconsistency is compatible
with the fact that, despite ubiquitous inconsistencies, most computing
systems in practice usually are able to provide meaningful information.
It seems that this mismatch has never been bothering the
community of computational logic to any significant degree.
However, this phenomenon has been more attentively observed
in the field of mathematical and philosophical logic. Around
the middle of last century, Stanislaw Jaskowski and Newton da
Costa have shown that inconsistency needs not be identified
with ex falso quodlibet. They devised paraconsistent logics
to cater for inconsistent yet useful theories. While the
potential of paraconsistency to study, explain and improve the
behavior of inconsistent systems has been widely recognized
in philosophical circles, it has not (yet) enjoyed a
broad-scale uptake in computational logic.
The workshop aims to raise the awareness of paraconsistency as
a matter of fact in everyday computing. It also is meant to
build a bridge between paraconsistent logic(s), on one side,
and theoreticians and practitioners of computing, on the other.
The workshop will provide a forum for presenting and discussing
existing and novel work on coping with inconsistency in all fields
of computational logic. Thus, it intends to further encourage,
fertilize and improve such work, and to lead paraconsistent logic
out of its current parochial status. Topics (in alphabetic order)
related to paraconsistency and computational logic include, but
are not limited to:
- Agents
- Argumentation
- Artificial
Intelligence
- Belief
Revision
- Constraint
Solving
- Contradiction
Removal
- Cooperative
and Distributed Databases
- Cybernetics
- Data
Warehousing and Data Mining
- Defeasible
Reasoning
- Dynamics
of Computing Systems
- Epistemic
and Ontologic Issues
- Evolutionary
Computing
- Federated
and Heterogeneous Databases
- Formal
and Semi-Formal Methods
- Integrity
Constraints
- Knowledge
Engineering
- Knowledge
Management
- Non-Monotonicity
- Security
- Semantic
Web
- Semi-Structured
Data
- Theoretical
Foundations
We solicit unpublished extended drafts and full papers
(approx. 5 - 15 pages), which emphasise their relation to
paraconsistency and computational logic. Submissions can be
sent by email to one of the organizers. The preferred format
is as attachments of .ps or .pdf files of papers conforming
to (the size of) the SLNCS
format.
All submissions will be reviewed. Proceedings of accepted
papers will be available at workshop time and distributed to
all participants.
Invited speakerProgram Committee- Rajiv Bagai, Wichita State
U, USA
- Leopoldo Bertossi, Carleton
U, Canada
- Jean-Yves
Beziau, Stanford U, USA
- Harold Boley, DFKI
Kaiserslautern, Germany
- François
Bry, U Munich, Germany
- Walter A. Carnielli,
State U of Campinas, Brazil
- Jeremy Carroll, HP Labs
Bristol, UK
- Jan Chomicki, State U of New
York-Buffalo, USA
- Carlos Damásio, New U of Lisbon,
Portugal
- Thomas
Lukasiewicz, Vienna U of Techn., Austria
- Jerzy Perzanowski,
Copernicus U of Torun, Poland
- Francesca Toni, Imperial College, UK
- Jean-Paul Van Bendegem,
Vrije U of Brussels, Belgium
Organizers | |
![[previous]](../img/prev.gif){kind=small}
![[up]](../img/up.gif){kind=small}
![[next]](../img/next.gif){kind=small}
