logo logo

Insert the RP-DeLP program

Solver options:

SAT ASP

Output options:

Maximal Ideal Multiple

Strict knowledge:

Defeasible level 1:

Add level | Remove level | Reset

Preloaded examples

Example thesis:(Click here to load this example in the form)

Strict part:

Defeasible part:

p.

q.

r.

~p :- q,r.

~q :- p,r.

~r :- p,q.

Example 1:(Click here to load this example in the form)

Strict part:

p.

Defeasible part:

h.

q.

~h :- q.

~q :- h.

Example 2:(Click here to load this example in the form)

Strict part:

Defeasible part:

p.

q.

~p :- q.

~q :- p.

h :- p.

h :- q.
Example 3:(Click here to load this example in the form)

Strict part:

~q1 :- q2, q3.

~q2 :- q1, q3.

~q3 :- q2, q1.

Defeasible part:

q1.

q2.

q3.

qdp :- q1, q2.

qdp :- q1, q3.

qdp :- q2, q1.
Example 4:(Click here to load this example in the form)

Input syntaxis:

The input, either the strict part or a defeasible part, is a sequence of clauses. The strict part can be empty.
  • A clause is either a fact or a rule.
  • A fact is simply a literal. Where a literal is either a proposition or a negated proposition.
  • A proposition is an alphanumeric word starting with a letter and the negation symbol is ~.
  • A rule has the form:

          conclusion :- body.

    where conclusion is a literal and body is a sequence of one ore more literals separated by commas.

    • Don't hesitate to contact:

    fguitart (at) diei (dot) udl (dot) cat