J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....under the usual Kripke semantics for modal logic [Kripke, 1963, Fitting, 1983] I will not consider interactions of disjunction with negation by failure and other operational features of of logic programming proof search systems. For such issues in disjunctive logic programming, see for example [Lobo et al. 1992]. Nor will I attempt to describe a minimal model or fixed point construction in which exactly the consequences of a modal program hold, as in [Orgun and Wadge, 1992] Moreover, my interest is in specific fragments of specific modal logics in particular. Modularity and locality allow consideration ....

Lobo, J., Minker, J., and Rajasekar, A. (1992). Foundations of Disjunctive Logic Programming. MIT Press.

....values. 1 Introduction Disjunctive logic programs are logic programs where disjunction is allowed in the heads of the rules and negation may occur in the bodies of the rules. Such programs are nowadays widely recognized as a valuable tool for knowledge representation and commonsense reasoning [3, 16, 22]. An important merit of disjunctive logic programming (DLP) is its capability to model incomplete knowledge [3, 22] DLP has a very high expressive power. In [14] it is proved that, under stable model semantics, disjunctive programs capture the complexity class Sigma 2 , that is, they allow to ....

....the rules and negation may occur in the bodies of the rules. Such programs are nowadays widely recognized as a valuable tool for knowledge representation and commonsense reasoning [3, 16, 22] An important merit of disjunctive logic programming (DLP) is its capability to model incomplete knowledge [3, 22]. DLP has a very high expressive power. In [14] it is proved that, under stable model semantics, disjunctive programs capture the complexity class Sigma 2 , that is, they allow to express every property which is decidable in non deterministic polynomial time with an oracle in NP. Thus, DLP can ....

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.

....expressive KR R formalisms. Disjunctive logic programs are logic programs where disjunction is allowed in the heads of the rules and negation may occur in the bodies of the rules. Such programs are now widely recognized as a valuable tool for knowledge representation and commonsense reasoning [7, 73, 100, 32, 55, 70, 77, 6]. One of the attractions of disjunctive logic programming (DLP) is its capability of allowing the natural modeling of incomplete knowledge [7, 73] Much research has been spent on the semantics of disjunctive logic programs, and several alternative semantics have been proposed [10, 47, 55, 76, 85, ....

....of the rules. Such programs are now widely recognized as a valuable tool for knowledge representation and commonsense reasoning [7, 73, 100, 32, 55, 70, 77, 6] One of the attractions of disjunctive logic programming (DLP) is its capability of allowing the natural modeling of incomplete knowledge [7, 73]. Much research has been spent on the semantics of disjunctive logic programs, and several alternative semantics have been proposed [10, 47, 55, 76, 85, 88, 86, 92, 93] see [2, 24, 73, 77, 78] for comprehensive surveys) The most widely accepted semantics is the answer sets semantics proposed by ....

[Article contains additional citation context not shown here]

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

.... December 2000 aspects such as incomplete or inde nite information, have been proposed to date, cf. 1,34] In particular, the use of disjunction in rule heads for expressing inde nite information was proposed in Minker s seminal paper [33] which started interest in disjunctive logic programming [31,11]. For example, the rule lives in(x; us) lives in(x; can) lives in(x; mex) lives in(x; n america) 1) informally states that a person living in north America lives in one of the three countries there. The semantical and computational aspects of disjunctive logic programming, and in ....

....results are developed in Section 6. Section 7 considers restricted data disjunctions and applies the results to closed world reasoning in databases. The nal Section 8 concludes the paper. 2 Preliminaries 2. 1 Deductive databases For a background on disjunctive deductive databases, we refer to [31]. 2.1.0.1 Syntax. A nite relational language is a tuple = R 1 ; R n ; c 1 ; c m ) where the R i are relation symbols (also called predicate symbols) with associated arities a 1 ; a n , and the c i are constant symbols. An atom is a formula of the form R i ( v) where ....

[Article contains additional citation context not shown here]

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.

.... various aspects such as incomplete or indefinite information, have been proposed to date, cf. 1, 33] In particular, the use of disjunction in rule heads for expressing indefinite information was proposed in Minker s seminal paper [32] which started interest in disjunctive logic programming [30, 10]. For example, the rule lives in(x; US) lives in(x; canada) lives in(x; mexico) lives in(x; n america) 1) informally states that a person living in north America lives in one of the three countries there. The semantical and computational aspects of disjunctive logic programming, and in ....

....complexity of function computations, upgrading results are developed in Section 6. The final Section 7 applies the results to the area of closed world reasoning and gives some conclusions. 2 Preliminaries 2. 1 Deductive databases For a background on disjunctive deductive databases, we refer to [30]. Syntax. A finite relational language is a tuple = R 1 ; R n ; c 1 ; c m ) where the R i are relation symbols (also called predicate symbols) with associated arities a 1 ; a n , and the c i are constant symbols. An atom is a formula of the form R i (v) where v is a ....

[Article contains additional citation context not shown here]

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.

....range of KR problems is still at an early stage. A step in this direction is the dlv system, which is actively being developed at the Institut f ur Informationssysteme, Technische Universit at Wien. This system is based on the function free (datalog) fragment of disjunctive logic programming [28, 12], and embodies a general purpose disjunctive datalog engine. The implementation relies on algorithms and results presented in [25] which have been subsequently re ned and improved. Due to the expressive power of the language [12, 2] the system is capable of eciently expressing problems whose ....

....dlv, we obtain all diagnoses of the input diagnosis problem. We show then in Section 6 the overall architecture of the system, and conclude the paper in Section 7. 2 Preliminaries on Disjunctive Logic Programming For a full background on (disjunctive) logic programming, we refer to [27] 3] [28] and [12] For an overview of semantics for (disjunctive) logic programs, see [10] The language described in this paper (Datalog ) has been described in [2] A term is either a constant or a variable . An atom is a(t 1 ; t n ) where a is a predicate of arity n and t 1 ; t n are ....

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

....dynamic. For example, consider the following Chronolog[Wad88] program simulating the operation of the traffic lights: first light(green) next light(amber) light(green) next light(red) light(amber) next light(green) light(red) On the other hand, disjunctive logic programming[MRL91, LMR92] was introduced as a formalism for expressing uncertainty: plays(john,soccer) plays(john,basketball) sportsman(X) plays(X,Y) sport(Y) sport(soccer) sport(basketball) From this program, it can be easily extracted as a conclusion that john is a sportsman, even though there is no exact ....

....example 3.1) The temporal Herbrand base of the program P in example 3. 1 is: BP = ffirst rains, first next rains, first next rains, first snows, first next snows, first next snows, first wet, first next wet, first next wet, g: ffl As in disjunctive logic programming[LMR92], a Disjunctive Chronolog program does not have in general a unique minimal temporal Herbrand model. Instead, the meaning of a Disjunctive Chronolog program is captured by the set of minimal temporal Herbrand models of the program. Theorem 3.1. Let P be a Disjunctive Chronolog program. A canonical ....

[Article contains additional citation context not shown here]

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

....direction is the dlv 1 system, which is actively being developed at the Institut fur Informa1 dlv stands for Datalog , i.e. Datalog with disjunction. tionssysteme, Technische Universitat Wien. This system is based on the function free (datalog) fragment of disjunctive logic programming [28, 12], and embodies a general purpose disjunctive datalog engine. The implementation relies on algorithms and results presented in [25] which have been subsequently refined and improved. Due to the expressive power of the language [12, 2] the system is capable of efficiently expressing problems whose ....

....dlv, we obtain all diagnoses of the input diagnosis problem. We show then in Section 6 the overall architecture of the system, and conclude the paper in Section 7. 2. Preliminaries on Disjunctive Logic Programming For a full background on (disjunctive) logic programming, we refer to [27] 3] [28] and [12] For an overview of semantics for (disjunctive) logic programs, see [10] The language described in this paper ) has been described in [2] A term is either a constant or a variable . An atom is a(t 1 ; t n ) where a is a predicate of arity n and t 1 ; t n are terms. A ....

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

....has been implemented in a DLP system, and a number of experiments and benchmarks have been run. 1 Introduction Disjunctive logic programming (DLP) with stable model semantics is a powerful nonmonotonic formalism for knowledge representation and commonsense reasoning [ Baral and Gelfond, 1994; Lobo et al. 1992 ] DLP has a very high expressive power [ Eiter et al. 1997a ] and it allows to represent complex problems in a simple and easy to understand fashion [ Eiter et al. 1998 ] As for the other main nonmonotonic formalisms, reasoning with DLP (under stable model semantics) is very hard. The ....

....4 describes our new reduction from stable model checking to UNSAT. Section 5 reports on our experiments. 2 Disjunctive Logic Programming with Stable Model Semantics In this section, we provide an overview of disjunctive logic programming with stable model semantics. For further details, see [ Lobo et al. 1992 ] The terms of the language are inductively defined. A variable or constant is a term; a function symbol with terms as arguments is a term. An atom is a(t 1 , t n ) where a is a predicate of arity n and t 1 , t n are terms. A literal is either a positive literal p or a negative ....

J. Lobo, J. Minker, A. Rajasekar (1992), "Foundations of disjunctive logic programming, " The MIT Press.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

No context found.

Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

No context found.

J. Lobo, J. Minker and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.

No context found.

Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge, Massachusetts, 1992.

No context found.

Lobo, J., Minker, J., Rajasekar, A.: Foundations of disjunctive logic programming. MIT Press, Cambridge (1992)

No context found.

J. Lobo, J. Minker and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of disjunctive logic programming. The MIT Press, 1992.

No context found.

Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992.

No context found.

J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC