๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Embedding revision programs in logic programming situation calculus

โœ Scribed by Chitta Baral

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
827 KB
Volume
30
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Predicate abstraction in a program logic
Predicate abstraction in a program logic calculus
โœ Benjamin WeiรŸ ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 335 KB

Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. This paper explores a way to integrate predicate abstraction into a calculus for deductive program verification based on symbolic exe

The complexity of revising logic program
The complexity of revising logic programs
โœ Russell Greiner ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 237 KB

A rule-based program will return a set of answers to each query. An impure program, which includes the Prolog ut ``!'' and ``not@รA'' operators, can return dierent answers if its rules are re-ordered. There are also many reasoning systems that return only the ยฎrst answer found for each query; these

Conditional reasoning in logic programmi
Conditional reasoning in logic programming
โœ D. Gabbay; L. Giordano; A. Martelli; N. Olivetti; M.L. Sapino ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

We introduce a logic programming language which supports hypothetical and counterfactual reasoning. The language is based on a conditional logic which enables to formalize conditional updates of the knowledge base. Due to the presence of integrity constraints, alternative revisions of the knowledge