Abstract | ||
---|---|---|
In this paper, we describe a disjunctive logic programming system, referred to as DisLoP,based on PROTEIN theorem prover. PROTEIN supports certain theorem provingcalculi, such as restart model elimination and hyper tableaux, that are suitable for workingwith positive disjunctive logic programs. In particular, restart model eliminationcalculus is answer complete for postive queries. The DisLoP project started at this pointwith the aim of extending this further to minimal model... |
Year | DOI | Venue |
---|---|---|
1996 | 10.1007/3-540-61708-6_42 | KI |
Keywords | Field | DocType |
protein theorem prover,disjunctive logic programming system,theorem prover | Model elimination,Discrete mathematics,Programming language,Second-order logic,Automated theorem proving,Disjunctive normal form,Minimal model,Stable model semantics,Logic programming,Skolem normal form,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-61708-6 | 2 | 0.38 |
References | Authors | |
14 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chandrabose Aravindan | 1 | 137 | 23.13 |