Modality and interrupts

We suggest that modal operators, in addition to their well-understood semantic role in declarative systems, also mark points at which these systems can be interrupted. We use this idea to describe an interruptible declarative system that gradually refines its responses to queries. Although initial responses may be in error, a correct answer will be provided if arbitrarily large computational resources are available. The ideas presented generalize existing work on stratification of logic programs and the treatment of floundered subgoals.

[1]  Raymond Reiter,et al.  On Interacting Defaults , 1981, IJCAI.

[2]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[3]  Donald Perlis.  Non-Monotonicity and Real-Time Reasoning , 1984, NMR.

[4]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[5]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[6]  B. Habibi,et al.  Pengi : An Implementation of A Theory of Activity , 1998 .

[7]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[8]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[9]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[10]  Matthew L. Ginsberg.  Bilattices and Modal Operators , 1990, J. Log. Comput..

[11]  Leslie Pack Kaelbling,et al.  Goals as Parallel Program Specifications , 1988, AAAI.

[12]  Bart Selman,et al.  Knowledge Compilation using Horn Approximations , 1991, AAAI.

[13]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[14]  Mark Drummond,et al.  Situated Control Rules , 1989, KR.

[15]  Oskar Dressler.  Assumption-Based Truth Maintenance , 1986, Begründungsverwaltung.

[16]  J. Dekleer.  An assumption-based TMS , 1986 .

[17]  Matthew L. Ginsberg,et al.  Approximate Planning , 1995, Artif. Intell..

[18]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[19]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[20]  Matthew L. Ginsberg.  The MVL theorem proving system , 1991, SGAR.

[21]  John L. Bresina,et al.  Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction , 1990, AAAI.

[22]  B. Skyrms.  Choice and chance : an introduction to inductive logic , 1968 .

[23]  Matthew L. Ginsberg,et al.  Multivalued logics: a uniform approach to reasoning in artificial intelligence , 1988, Comput. Intell..

[24]  D Perlis Univer,et al.  Non-monotonicity and Real-time Reasoning , 2022 .

[25]  Matthew L. Ginsberg,et al.  Computational Considerations in Reasoning about Action , 1991, KR.

[26]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[27]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[28]  A. Haas.  The Case for Domain-Specific Frame Axioms , 1987 .

[29]  Donald Perlis,et al.  Step-logic: reasoning situated in time , 1988 .

[30]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[31]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[32]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[33]  David Chan,et al.  An Extension of Constructive Negation and its Application in Coroutining , 1989, NACLP.

[34]  Lenhart K. Schubert.  Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds wi , 1990 .

[35]  Matthew L. Ginsberg,et al.  Negative Subgoals with Free Variables , 1991, J. Log. Program..

[36]  Kurt Konolige,et al.  On the Relation Between Default Theories and Autoepistemic Logic , 1987, IJCAI.

[37]  Matthew L. Ginsberg.  A Circumscriptive Theorem Prover , 1989, Artif. Intell..

[38]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[39]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[40]  Donald Perlis,et al.  Reasoning situated in time I: basic concepts , 1990, J. Exp. Theor. Artif. Intell..

[41]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[42]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..