Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

EPIA
2001
Springer

favoriteEmaildiscussreport

91views Artificial Intelligence» more EPIA 2001»

A Procedural Semantics for Multi-adjoint Logic Programming

13 years 9 months ago

A Procedural Semantics for Multi-adjoint Logic Programming

Download sevein.matap.uma.es

Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, a procedural semantics is given for the paradigm of multiadjoint logic programming and completeness theorems are proved.

Jesús Medina, Manuel Ojeda-Aciego, Peter Vo

Real-time Traffic

Artificial Intelligence | EPIA 2001 | Logic Program Generalise | Logic Programs | Monotonic Logic Programs |

claim paper

Related Content

» A TopDown Procedure for Disjunctive WellFounded Semantics

» Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents

» Runtime Addition of Integrity Constraints in an Abductive Proof Procedure

» Static Semantics as Program Transformation and Wellfounded Computation

» Temporal Disjunctive Logic Programming

» A dialectic procedure for sceptical assumptionbased argumentation

» Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs

» Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm

» Query Answering in Belief Logic Programming

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	EPIA
Authors	Jesús Medina, Manuel Ojeda-Aciego, Peter Vojtás

Comments (0)