2,409 Hits in 3.8 sec

Stable generated models, partial temporal logic and disjunctive defaults

Joeri Engelfriet, Heinrich Herre
1999 The Journal of Logic Programming  
Then we introduce several new versions of (disjunctive) default logic and show that there are strong (semantical) connections between default logic and logic programming with stable generated models.  ...  We show that stable generated semantics for extended logic programs coincides with the semantics obtained by translating programs into a minimal partial temporal logic.  ...  Wagner for valuable comments and discussions. Thanks also due to the anonymous referees for their criticism and useful comments.  ... 
doi:10.1016/s0743-1066(99)00008-4 fatcat:x5lmnojdpzheza7yule6ncmw4m

Page 1958 of Mathematical Reviews Vol. , Issue 2001C [page]

2001 Mathematical Reviews  
programs, and minimal temporal partial models.  ...  {For the entire collection see MR 2001b:68010.} 2001¢:68025 68N17 03B44 Engelfriet, Joeri (NL-VUAMM; Amsterdam); Herre, Heinrich (D-LEIP-II; Leipzig) Stable generated models, partial temporal logic and  ... 

Page 3444 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
These results establish a close relation among three different approaches to nonmonotonic reasoning: stable generated models of logic programs, default logic, and minimal partial temporal logic.”  ...  We show that stable generated semantics coincide with the semantics obtained by translating programs into a minimal partial temporal logic into which a subsystem of default logic can be embedded.  ... 

An overview of nonmonotonic reasoning and logic programming

Jack Minker
1993 The Journal of Logic Programming  
, partial disjunctive stable models coincide with well-founded semantics; for locally stratified disjunctive programs, both (total and partial) disjunctive semantics coincide with the perjkt model semantics  ...  Przymusinski [1721 introduces the stable model semantics for disjunctive logic programs and disjunctive deductive databases. This generalizes the stable model semantics for normal logic programs.  ... 
doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm

Forthcoming Papers

2003 Artificial Intelligence  
Disjunctive logic programming (DLP) with stable model semantics is a powerful nonmonotonic formalism for knowledge representation and reasoning.  ...  Reasoning with DLP is harder than with normal (∨-free) logic programs, because stable model checking-deciding whether a given model is a stable model of a propositional DLP program-is co-NP-complete, while  ...  about Disjunctive Temporal Problems (DTPs).  ... 
doi:10.1016/s0004-3702(03)00180-2 fatcat:4wdss2ra6ja6poxv4t7uvtl3pq


1999 The Journal of Logic Programming  
Herre, Stable generated models, partial temporal logic and disjunctive defaults (1) 1±25 Flener, P. and S.  ...  Martens and M.H. Sùrensen, Conjunctive partial deduction: foundations, control, algorithms, and experiments (2±3) 231±277 Deville, Y., see Bossi, A. Ridoux, O., see Belleanne Âe, C.  ... 
doi:10.1016/s0743-1066(99)00056-4 fatcat:vwkzbf7lbzdi7lsbbmf6ya5ofu

Page 7295 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
The translation of rule update into default logic, thus into a well-known nonmonotonic formalism, suggests a possible generalization of rule update to a disjunctive rule update based on disjunctive default  ...  The selection functions turn out to be a restriction on the conditional selection function of Stalnaker, and it is shown that the selection functions can model variants of partial and of full meet contractions  ... 

Knowledge representation with logic programs [chapter]

Gerhard Brewka, Jürgen Dix
1998 Lecture Notes in Computer Science  
In this tutorial-overview, which resulted from a lecture course given by the authors at the European Summer School in Logic, Language and Information 1997 in Aix-en-Provence (  ...  Fuchs, Ulrich Furbach, Ilkka Niemelä and Chiaki Sakama who provided us with many useful remarks. Katrin Erk and Dorothea Schäfer proofread parts of the paper-special thanks to them.  ...  STABLE for Extended Logic Programs The extension of STABLE to extended logic programs is based on the notion of answer sets which generalize the original notion of stable models in a rather straightforward  ... 
doi:10.1007/bfb0054788 fatcat:5fa5wrvqgnco5kdgef2zcsrysm

Forthcoming papers

1998 Artificial Intelligence  
The divergence between prior and posterior probability distributions at model components is used as indication on inconsistency between model structure, parameter values, and other information used.  ...  A belief network is constructed to work parallel to a deterministic model, and it is used to update conditional probabilities associated with different components of that model.  ...  Bochman, On the relation between default and modal nonmonotonic reasoning The notion of a default consequence relation is introduced as a generalization of both default and modal formalizations of nonmonotonic  ... 
doi:10.1016/s0004-3702(98)00038-1 fatcat:x4ydqgpzrfdxnepjsvgfi5mv4a

Page 442 of Mathematical Reviews Vol. , Issue 92a [page]

1992 Mathematical Reviews  
Summary: “We introduce 3-valued stable models which are a nat- ural generalization of standard (2-valued) stable models.  ...  Moreover, it can be shown that the 3-valued stable semantics has a natural extension to the class of all disjunctive logic programs and deductive databases.  ... 

Page 5360 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
It constructively defines an “alternating fixpoint model” for any logic pogram, which model is proven to be identical with the well-founded partial model for the program.  ...  Also, both classical and default negation have been incorporated into the near-Horn Prolog systems.  ... 

Page 4549 of Mathematical Reviews Vol. , Issue 92h [page]

1992 Mathematical Reviews  
, and Mirostaw Truszczynski, Disjunctive defaults (pp. 230-237); Michael R.  ...  Carnes, Clustering temporal intervals to generate refer- ence hierarchies (pp. 111-117); James P. Delgrande and W. Ken Jackson, Default logic revisited (pp. 118-127); Premkumar T.  ... 

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

James Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang
2004 Computational intelligence  
Here, we present an overview and classification for approaches to dealing with preference.  ...  A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles.  ...  Smodels: An Implementation of the Stable Model and Well-Founded Semantics for Normal Logic Programs.  ... 
doi:10.1111/j.0824-7935.2004.00240.x fatcat:2athvzwyazgobgqki57falevsi

Tracking object's type changes with fuzzy based fusion rule [article]

Albena Tchamova, Florentin Smarandache
2009 arXiv   pre-print
t-conorm based Disjunctive rule as an analog of the ordinary disjunctive rule.  ...  In this paper the behavior of three combinational rules for temporal/sequential attribute data fusion for target type estimation are analyzed.  ...  Acknowledgement: This work is founded and supported by the Bulgarian National Science Fundgrant MI-1506/05.  ... 
arXiv:0910.1433v1 fatcat:rxafv2x5pvdcbovynkjsm4n4ja

Book reports

1992 Computers and Mathematics with Applications  
An alternative characterizaton of disjunctive logic programs. HI. Non-monotonicity, I. 5. Well-founded semantics, generalized. 6. Stable theories for logic programs. IV.  ...  Temporal logic programming and its relation to constraint logic programming. 42. Integrating numerical and qualitative models within constraint logic programming. 43.  ... 
doi:10.1016/0898-1221(92)90096-z fatcat:4pjyhq2h5zcxzcjs7pzcgpop54
« Previous Showing results 1 — 15 out of 2,409 results