{"type":"ScholarlyArticle","title":"Prolog Extensions Based on Tableau Calculus","authors":[{"name":"Wolfgang Schönfeld","slug":"wolfgang-schonfeld","given":"Wolfgang","family":"Schönfeld","affiliation":""}],"abstract":"The intention of this paper is to help bridging the gap between logic programming and theorem proving. lt presents the design of a Gentzen type proof search procedure, based on classical tableau calculus, for knowledge bases consisting of arbitrary frrst order formulas. At each proof search step, when a new formula is to be chosen from the knowledge base, the procedure chooses in such a way that the search space is small. When applied to a Horn clause knowledge base and an atomic goal, it performs the same proof search steps as any PROLOGinterpreter would do. Hence, PROLOG can be viewed as a special Gentzen type procedure just as it is a special (namely, linear input) resolution procedure.","doi":null,"url":"https://ijcai.org/proceedings/1985/144","pdf":"https://ijcai.org/proceedings/1985/0144.pdf","markdown":"https://ijcai.org/proceedings/1985/144.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/144","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Logic Programming","track":"Logic Programming","number":144,"pages":{"first":730,"last":731},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}