1 - 7 of 7 articles
Incidence Calculus is a technique for associating uncertainty values with logical sentences. These uncertainty values are called incidences and they are sets of points, which may be thought of as representing equivalence classes of situations, Tarskian models, or possible worlds. Incidence...
When searching lists, the current situation is represented by a state table, and changes in the situation are brought about by operators. An automated technique for selection of the right sequence of operators is described, based on a knowledge of the last operator or two, and deriving only a...
An extension of the class of logic programs for which the Negation as Failure rule is equivalent to the Closed World Assumption is presented. This extension includes programs on infinite domains and with recursive definitions. For this class of programs with ground (positive or negative) queries...
We present a decision procedure for formulae of discrete linear time propositional temporal logic whose propositional part may include assertions in a specialized theory. The combined decision procedure may be viewed as an extension of known decision procedures for quantifier-free theories to...
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.