<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vermeir, Timothy</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">From Wffs to Clauses: Transforming Wffs in Clauses Without Loss of Meaning</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper is the rst step into the research of inconsistency-adaptive logic programming. It will be shown here that a mapping can be dened for well formed formulas to logic programming clauses in a paraconsistent environment, and without loss of information. Furthermore, this mapping is a purely mechanical procedure that can be implemented with ease on a computer.&lt;/p&gt;</style></abstract></record></records></xml>