Joel Luis, Rich, and Tara, (01)
Thanks for the references. (02)
JLC
> I think that I have found some applications... (03)
Yes, those are good examples of useful applications. I did not
track down all the references, but the first one contained the
comment "last, we state our future development of EVALPSN for
defeasible deontic control." (04)
That confirms my suspicion that this is an interesting research
area, but the applications are still exploratory developments.
It's mostly R with wishful thinking about practical D. (05)
RC
> Here is an article that explains the basic math:
>
> 3.3 On the Philosophy and Mathematics
> of the Logics of Formal Inconsistency
>
> which starts on page 19 of the following URL:
> http://www.paraconsistency.org/book/Handbook-WCP5.pdf (06)
The book covers a wide range of topics on reasoning about inconsistency
by computers *and* by humans. (07)
It led me to a good survey article about methods for combining logics:
http://plato.stanford.edu/entries/logic-combining/ (08)
This is another example of heavy R and little or no D. If I were
advising an engineer with a limited budget and a tight deadline,
I'd suggest something else. (09)
TA
> Based on the Stanford article, I would say that that following
> all qualify as paraconsistent logics (emphasis on the plural)
> * Defeasible Logics
> * Default Logics
> * Fuzzy Logics
> * Logic programming with negation as failure (010)
I agree that all of them are related ways of addressing similar
problems. In fact, the article mentioned above discusses the
relationship between EVALPSN and "conventional logic programming". (011)
But these methods have been used in practical applications for
over 3o years. Perhaps the theories of paraconsistent logic may
provide a unified foundation for them. That would be useful. (012)
> It appears that paraconsistent logics must be non-monotonic.
> I think it is important to bear in mind that paraconsistent
> is a characteristic that a logic can have, but many different
> logics can have this characteristic. (013)
I agree. (014)
I would add belief revision as a method of handling similar problems.
BR methods use metalevel reasoning about possibly inconsistent FO
theories to produce a revised and consistent FO theory. (015)
For a good 42-page intro and overview of belief revision methods, (016)
Peppas, Pavlos (2008) Belief revision, _Handbook of KR_,
http://pavlos.bma.upatras.gr/papers/8.pdf (017)
The advantage of belief (or theory) revision is that the final
result is FOL, which can be represented and implemented in a
wide range of well supported systems. (018)
John (019)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J (020)
|