Difference between revisions of "Logic Programming"
From Termination-Portal.org
Jump to navigationJump to search (New page: This page is to record the current status of discussion on cleaning up the Logic Programming Category of the Termination Competition. (Discussion should take place on the termtools maili...) |
|||
| Line 13: | Line 13: | ||
This means all queries :- p(s,t). where s is a ground term | This means all queries :- p(s,t). where s is a ground term | ||
and t can be any term. | and t can be any term. | ||
| + | |||
| + | == Problematic Examples == | ||
| + | |||
| + | The following examples are empty: | ||
| + | * LP/talp/apt/dc_mod.pl | ||
| + | * LP/talp/apt/gt_mod.pl | ||
== Questions == | == Questions == | ||
Revision as of 16:16, 29 October 2008
This page is to record the current status of discussion on cleaning up the Logic Programming Category of the Termination Competition.
(Discussion should take place on the termtools mailing list.)
Syntax/Semantics for Input/Output
The set of queries, for which termination should be analyzed, is given by a comment in the first line. Example:
%query: p(i,o).
This means all queries :- p(s,t). where s is a ground term and t can be any term.
Problematic Examples
The following examples are empty:
- LP/talp/apt/dc_mod.pl
- LP/talp/apt/gt_mod.pl
Questions
- should empty examples be removed?
- how to handle built-ins that the tool does not support?
- do we want to have a (sub-)category "pure logic programs"?
Participants
The following is a list of participants to this category
