Extensions of Deductive Concept in Logic Programming and Some Applications
Ivana Berković, Biljana Radulović, Petar Hotomski · InTech eBooks · 2009
The paper presents ATP - a system for automated theorem proving based on ordered linear resolution with marked literals, its putting into the base of prolog-like language and some applications. This resolution system is especially put into the base of prolog-like language, as the surrogate for the concept of negation as definite failure. This logical complete deductive base is used for building a descriptive logical programming language LOGPRO, which enables eliminating the defects of PROLOG-system (the expansion concerning Horn clauses, escaping negation treatment as definite failure), but keeping the main properties of PROLOG-language and possibilities of its expansions. Some features of the system when it is used as the base for time-table and scheduling, a technique for the implicational problem resolving for generalized data dependencies and intelligent tutoring system are described.