Logic for problem-solving
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
HOPL-II The second ACM SIGPLAN conference on History of programming languages
Equations, sets, and reduction semantics for functional and logic programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
ACM SIGSOFT Software Engineering Notes - Proceedings of VERkshop III -- a formal verification workshop
History of programming languages---II
A logic programming and verification system for recursive quantificational logic
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
TABLOG (Tableau Logic Programming Language) is a language combining functional and logic programming using first-order (quantifier-free) predicate logic with equality. TABLOG incorporates advantages of LISP and PROLOG. A program in TABLOG is a list of formulas in a first-order logic (including equality, negation, and equivalence) that is more general and more expressive than PROLOG'S Horn clauses. Whereas PROLOG programs must be relational, TABLOG programs may define either relations or functions. While LISP programs yield results of a computation by returning a single output value, TABLOG programs can be relations and can produce several results simultaneously through their arguments.