<abstract xmlns="http://www.w3.org/1999/xhtml"><p>The backward-chaining inference strategy of Prolog is inefficient for a number of problems. The article proposes Contralog: a Prolog-conform, forward-chaining language and an inference engine that is implemented as a preprocessor-compiler to Prolog. The target model is Prolog, which ensures mutual switching from Contralog to Prolog and back. The Contralog compiler is implemented using Prolog's de facto standardized macro expansion capability. The article goes into details regarding the target model.</p><p>We introduce first a simple application example for Contralog. Then the next section shows how a recursive definition of some problems is executed by their Contralog definition automatically in a dynamic programming way. Two examples, the well-known matrix chain multiplication problem and the Warshall algorithm are shown here. After this, the inferential target model of Prolog/Contralog programs is introduced, and the possibility for implementing the ReALIS natural language parsing technology is described relying heavily on Contralog's forward chaining inference engine. Finally the article also discusses some practical questions of Contralog program development.</p></abstract>

The backward-chaining inference strategy of Prolog is inefficient for a number of problems. The article proposes Contralog: a Prolog-conform, forward-chaining language and an inference engine that is implemented as a preprocessor-compiler to Prolog. The target model is Prolog, which ensures mutual switching from Contralog to Prolog and back. The Contralog compiler is implemented using Prolog's de facto standardized macro expansion capability. The article goes into details regarding the target model.We introduce first a simple application example for Contralog. Then the next section shows how a recursive definition of some problems is executed by their Contralog definition automatically in a dynamic programming way. Two examples, the well-known matrix chain multiplication problem and the Warshall algorithm are shown here. After this, the inferential target model of Prolog/Contralog programs is introduced, and the possibility for implementing the ReALIS natural language parsing technology is described relying heavily on Contralog's forward chaining inference engine. Finally the article also discusses some practical questions of Contralog program development.

Contralog: a Prolog conform forward-chaining environment and its application for dynamic programming and natural language parsing

University of Dunaújváros, Dunaújváros, Hungary

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The backward-chaining inference strategy of Prolog is inefficient for a number of problems. The article proposes Contralog: a Prolog-conform, forward-chaining...

Contralog: a Prolog conform forward-chaining environment and its application for dynamic programming and natural language parsing

Published Online: Jun 20, 2016

Page range: 41 - 62

Received: Feb 09, 2016

DOI: https://doi.org/10.1515/ausi-2016-0003

Keywords
logic programming, mechanical theorem proving, forward chaining, dynamic programming, natural language parsing

© 2016 Imre Kilián, published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Contralog: a Prolog conform forward-chaining environment and its application for dynamic programming and natural language parsing

Published Online: Jun 20, 2016

Page range: 41 - 62

Received: Feb 09, 2016

DOI: https://doi.org/10.1515/ausi-2016-0003

Keywordslogic programming, mechanical theorem proving, forward chaining, dynamic programming, natural language parsing

© 2016 Imre Kilián, published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Keywords
logic programming, mechanical theorem proving, forward chaining, dynamic programming, natural language parsing