Dealing with Explicit Exceptions in Prolog

نویسندگان

  • Luigi Liquori
  • Maria Luisa Sapino
چکیده

Existing logic languages provide some simple "extra-logical" constructs for control manipulation , such as the cut of standard Prolog and the exception handling constructs of other versions of Prolog (e.g. SICStus Prolog). Aspects speciically concerning the ow of control in a language can be quite naturally modelled by means of the Denotational Semantics, and in particular the Denotational Semantics with Continuations. In this paper we deene a De-notational Semantics with Continuations to model the ow of control of a small fragment of a logic language with an explicit exception handling mechanism. Finally we show how the cut operator can be simulated by an appropriate use of the characterized exception handling constructs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logical control of an elevator with defeasible logic

The elevator control program described in this journal by Dyck and Caines [2] can be implemented more concisely in d-Prolog, a defeasible logic programming system developed by Nute [3, 4, 5]. In defeasible logic, more specific rules take precedence over more general ones. Thus, the d-Prolog programmer can state general rules and then give explicit exceptions, just as humans do when explaining c...

متن کامل

NoHR: Querying EL with Non-monotonic Rules

We present NoHR, a Protégé plug-in that allows the user to take an EL+⊥ ontology, add a set of non-monotonic (logic programming) rules – suitable e.g. to express defaults and exceptions – and query the combined knowledge base. Provided the given ontology alone is consistent, the system is capable of dealing with potential inconsistencies between the ontology and the rules, and, after an initial...

متن کامل

Computing Answer Sets of CR-Prolog Programs

CR-Prolog is an extension of the knowledge representation language A-Prolog. The extension is built around the introduction of consistency-restoring rules (crrules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstrated in the literature, with examples that include plannin...

متن کامل

cr-models: An Inference Engine for CR-Prolog

CR-Prolog is an extension of the knowledge representation language A-Prolog. The extension is built around the introduction of consistency-restoring rules (cr-rules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstrated in the literature, with examples that include planni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994