<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="et">
	<id>http://www.lambda.ee/w/index.php?action=history&amp;feed=atom&amp;title=PLA001-1.ax</id>
	<title>PLA001-1.ax - Redigeerimiste ajalugu</title>
	<link rel="self" type="application/atom+xml" href="http://www.lambda.ee/w/index.php?action=history&amp;feed=atom&amp;title=PLA001-1.ax"/>
	<link rel="alternate" type="text/html" href="http://www.lambda.ee/w/index.php?title=PLA001-1.ax&amp;action=history"/>
	<updated>2026-11-07T03:17:35Z</updated>
	<subtitle>Selle lehekülje redigeerimiste ajalugu</subtitle>
	<generator>MediaWiki 1.43.11</generator>
	<entry>
		<id>http://www.lambda.ee/w/index.php?title=PLA001-1.ax&amp;diff=15674&amp;oldid=prev</id>
		<title>Tammet: Uus lehekülg: &#039;&lt;pre&gt; %-------------------------------------------------------------------------- % File     : PLA001-1 : TPTP v7.2.0. Released v1.0.0. % Domain   : Planning (Blocks world) % Axi...&#039;</title>
		<link rel="alternate" type="text/html" href="http://www.lambda.ee/w/index.php?title=PLA001-1.ax&amp;diff=15674&amp;oldid=prev"/>
		<updated>2019-03-20T09:34:12Z</updated>

		<summary type="html">&lt;p&gt;Uus lehekülg: &amp;#039;&amp;lt;pre&amp;gt; %-------------------------------------------------------------------------- % File     : PLA001-1 : TPTP v7.2.0. Released v1.0.0. % Domain   : Planning (Blocks world) % Axi...&amp;#039;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Uus lehekülg&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
%--------------------------------------------------------------------------&lt;br /&gt;
% File     : PLA001-1 : TPTP v7.2.0. Released v1.0.0.&lt;br /&gt;
% Domain   : Planning (Blocks world)&lt;br /&gt;
% Axioms   : Blocks world difference axioms for 4 blocks&lt;br /&gt;
% Version  : [SE94] axioms.&lt;br /&gt;
% English  :&lt;br /&gt;
&lt;br /&gt;
% Refs     : [Sus73] Sussman (1973), A Computational Model of Skill Acquisi&lt;br /&gt;
%          : [SE94]  Segre &amp;amp; Elkan (1994), A High-Performance Explanation-B&lt;br /&gt;
% Source   : [SE94]&lt;br /&gt;
% Names    :&lt;br /&gt;
&lt;br /&gt;
% Status   : Satisfiable&lt;br /&gt;
% Syntax   : Number of clauses    :   20 (   0 non-Horn;  19 unit;  19 RR)&lt;br /&gt;
%            Number of atoms      :   21 (   0 equality)&lt;br /&gt;
%            Maximal clause size  :    2 (   1 average)&lt;br /&gt;
%            Number of predicates :    2 (   0 propositional; 2-2 arity)&lt;br /&gt;
%            Number of functors   :    9 (   7 constant; 0-2 arity)&lt;br /&gt;
%            Number of variables  :    3 (   1 singleton)&lt;br /&gt;
%            Maximal term depth   :    2 (   1 average)&lt;br /&gt;
% SPC      : &lt;br /&gt;
&lt;br /&gt;
% Comments : Requires PLA001-0.ax&lt;br /&gt;
%          : The axioms are a reconstruction of the situation calculus&lt;br /&gt;
%            blocks world as in [Sus73].&lt;br /&gt;
%--------------------------------------------------------------------------&lt;br /&gt;
cnf(symmetry_of_differ,axiom,&lt;br /&gt;
    ( differ(X,Y)&lt;br /&gt;
    | ~ differ(Y,X) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_a_b,axiom,&lt;br /&gt;
    ( differ(a,b) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_a_c,axiom,&lt;br /&gt;
    ( differ(a,c) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_a_d,axiom,&lt;br /&gt;
    ( differ(a,d) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_a_table,axiom,&lt;br /&gt;
    ( differ(a,table) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_b_c,axiom,&lt;br /&gt;
    ( differ(b,c) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_b_d,axiom,&lt;br /&gt;
    ( differ(b,d) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_b_table,axiom,&lt;br /&gt;
    ( differ(b,table) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_c_d,axiom,&lt;br /&gt;
    ( differ(c,d) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_c_table,axiom,&lt;br /&gt;
    ( differ(c,table) )).&lt;br /&gt;
&lt;br /&gt;
cnf(differ_d_table,axiom,&lt;br /&gt;
    ( differ(d,table) )).&lt;br /&gt;
&lt;br /&gt;
%----Initial configuration&lt;br /&gt;
cnf(initial_state1,axiom,&lt;br /&gt;
    ( holds(on(a,table),s0) )).&lt;br /&gt;
&lt;br /&gt;
cnf(initial_state2,axiom,&lt;br /&gt;
    ( holds(on(b,table),s0) )).&lt;br /&gt;
&lt;br /&gt;
cnf(initial_state3,axiom,&lt;br /&gt;
    ( holds(on(c,d),s0) )).&lt;br /&gt;
&lt;br /&gt;
cnf(initial_state4,axiom,&lt;br /&gt;
    ( holds(on(d,table),s0) )).&lt;br /&gt;
&lt;br /&gt;
cnf(initial_state5,axiom,&lt;br /&gt;
    ( holds(clear(a),s0) )).&lt;br /&gt;
&lt;br /&gt;
cnf(initial_state6,axiom,&lt;br /&gt;
    ( holds(clear(b),s0) )).&lt;br /&gt;
&lt;br /&gt;
cnf(initial_state7,axiom,&lt;br /&gt;
    ( holds(clear(c),s0) )).&lt;br /&gt;
&lt;br /&gt;
cnf(initial_state8,axiom,&lt;br /&gt;
    ( holds(empty,s0) )).&lt;br /&gt;
&lt;br /&gt;
%----Table is always clear&lt;br /&gt;
cnf(clear_table,axiom,&lt;br /&gt;
    ( holds(clear(table),State) )).&lt;br /&gt;
&lt;br /&gt;
%--------------------------------------------------------------------------&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>Tammet</name></author>
	</entry>
</feed>