Abstract
In 1960 M. Davis and H. Putnam introduced some logical verification procedure for propositional languages - called later PutnamDavis procedure. It found a broad application in AI as a basis of the planning paradigm based on satisfiability of formulas. Unfortunately, this procedure refers to satisfiability in a classical two-valued logic. This paper is aimed at proposing some multi-valued extension of this procedure that may be sensitive to temporal and preferential aspects of reasoning. This method is evaluated in more practical contexts.
Cite
CITATION STYLE
Jobczyk, K., & Ligeza, A. (2017). Multi-valued extension of Putnam-Davis procedure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10246 LNAI, pp. 454–465). Springer Verlag. https://doi.org/10.1007/978-3-319-59060-8_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
