A. C. Kakas, R. A. Kowalski, and F. Toni, "Abductive Logic Programming, " Journal of Logic and Computation, vol. 2, no. 6, pp. 719--770, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in both compositional and non compositional dataflow analysis of logic programs, the reverse of deduction makes sense in modular logic programming. The process of reversing deduction is logically justified by the abductive reasoning (an excellent survey on the wide literature on abduction is in [27]) Abductive reasoning is formulated as follows: given a set of rules (clauses) P and a conjunction of atoms (an observation or simply a goal) G , find the set of atoms Q (the hypothesis) such that G is a logical consequence of P [ Q (see [27, 30] Atoms in Q are indicated as abducible ....

.... survey on the wide literature on abduction is in [27] Abductive reasoning is formulated as follows: given a set of rules (clauses) P and a conjunction of atoms (an observation or simply a goal) G , find the set of atoms Q (the hypothesis) such that G is a logical consequence of P [ Q (see [27, 30]) Atoms in Q are indicated as abducible information. In this paper we consider abduction in the context of static program analysis. We join abductive reasoning and abstract interpretation to derive program properties of modules, once the specification of the properties of their composition is ....

[Article contains additional citation context not shown here]

A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--770, 1993.

.... programming environment (which has traditionally been very strong on backward chaining methods, and thus is closely related to traditional planning techniques) Indeed, there has been a noticeable movement within logic programming to include abduction techniques into logic programming languages [25], which can be viewed as a means of determining how to make goals which fail into goals which succeed, i.e. a means of determining the actions necessary to achieve the goal. Abductive methods have generally been studied in the context of classical logic, which may be thought of as determining ....

A. Kakas, R. Kowalsk and F. Toni, Abductive Logic Programming, Journal of Logic and Computation 2:719-770, 1992.

.... has been proposed as a reasoning paradigm in AI for fault diagnosis [4] natural language understanding [4] default reasoning [15] 39] In the context of logic programming, abductive procedures have been used for planning [14] 48] 35, 34] knowledge assimilation and belief revision [23] [21], database updating [22] 11] showed the role of an abductive system for forms of reasoning, di erent from planning, in the context of temporal domains with uncertainty. The term abduction was introduced by the logician and philosopher C.S. Pierce (1839 1914) 38] who de ned it as the process ....

....of incomplete knowledge on causal e ects. One possibility is that one introduces a new symbol, e.g. open p, and adds the rule p open p to the rule set of p. open p can be thought of as the sub predicate of p caused by the unknown causes of p. This sort of translation was originally mentioned in [21]. I abduction will then produce answers using the known causes, but will also generate answers in terms of the unknown causes. Second, answers generated by i abduction logically entail the explained observation. But recall the syphilis example of section 1: causal explanations do not ....

A. C. Kakas, R.A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719-770, 1992.

....the ability to have user defined conditions to the program fragments sought run interleaved with the actions of demo. The full description of Demo is given in [10] here we give a brief overview focusing on potential database applications. 3. 1 View update by abduction We use an example from [21] as an introduction the use of Demo for database application. We have retouched away a few technical details, that are unnecessary for the points we want to illustrate here; all details can be found in [10] We consider a database with extensional predicates father and mother and view predicates ....

Kakas, A.A., Kowalski, R.A., Toni, F., Abductive logic programming. Journal of Logic and Computation 2, pp. 719--770, 1993.

....K. Furthermore, in [35] an algorithm for computing repairs is introduced. This algorithm is based on the tableau proof system for the three valued logic used in the framework. A related approach of Arieli et al. 10] introduces executable specifications of repairs using abductive logic programming [64]. In both approaches, however, no notion analogous to consistent query answers is proposed and no complexity analysis provided. Pradhan [85,86] introduced a logic for reasoning in the presence of contestations that are conflicts of di#erent kinds: logical, semantical, domain dependent, etc. They ....

C. Kakas, A, R. A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--770, 1992.

....in logic. Abduction is a well known reasoning process by which one can adopt hypotheses to the e#ect that some predicate instances (or their negations) are true in order to prove some conclusion. It s reasoning from goals to requirements, and has been extensively studied in the LP context [11]. Of course, the assumptions or hypotheses so adopted may later prove erroneous, if and when they lead to contradiction. We have then to make provision for the application of a contradiction removal process based on revising assumptions, possibly adopting of some other assumptions instead. This ....

A.Kakas, R.Kowalski, F.Toni, "Abductive Logic Programming", J.Logic and Computation, 2:719770, 1993.

....of disjunctive logic programming which are used for the kernel language of dlv. After that, we describe in Sections 3 and 4 the di erent formal models of diagnosis that are realized in the frontend. It supports both abductive diagnosis [31, 5] adapted to the semantics of logic programming [22, 11], and consistency based diagnosis [34, 9] In our abductive model of diagnosis (Section 3) the theory is a disjunctive logic program, whose semantics is given by the set of its stable models [20] This form of diagnostic reasoning has been recently proved to be highly expressive, as it is able ....

.... stable model of P e is fa; bg: STM(P e ) ffa; bgg Therefore the following consequences are valid: P e j= P e j= fag P e j= fbg P e j= fa; bg 4 3 Abductive Diagnosis over DLP Theories Abductive diagnostic reasoning has been widely studied in the literature in the last years (see, e.g. [31, 30, 23, 5, 22, 11]) Intuitively, a diagnostic problem consists of a description of the system to be diagnosed, observations of the actual state of the system, and possible reasons for e ects, which are usually errors. De nition 3 We de ne an abductive diagnostic problem (ADP) P as a triple hH; T; Oi, H is ....

A. Kakas, R. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 1993.

....of disjunctive logic programming which are used for the kernel language of dlv. After that, we describe in Sections 3 and 4 the different formal models of diagnosis that are realized in the frontend. It supports both abductive diagnosis [31, 5] adapted to the semantics of logic programming [22, 11], and consistency based diagnosis [34, 9] In our abductive model of diagnosis (Section 3) the theory is a disjunctive logic program, whose semantics is given by the set of its stable models [20] This form of diagnostic reasoning has been recently proved to be highly expressive, as it is able ....

....stable model of P e is fa; bg: STM(P e ) ffa; bgg Therefore the following consequences are valid: P e j= P e j= fag P e j= fbg P e j= fa; bg 3. Abductive Diagnosis over DLP Theories Abductive diagnostic reasoning has been widely studied in the literature in the last years (see, e.g. [31, 30, 23, 5, 22, 11]) Intuitively, a diagnostic problem consists of a description of the system to be diagnosed, observations of the actual state of the system, and possible reasons for effects, which are usually errors. Definition 3 We define an abductive diagnostic problem (ADP) P as a triple hH; T ; Oi, where: ....

A. Kakas, R. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 1993.

....fact, abduction plays an important role in much of human inference. It is relevant to our everyday commonsense reasoning as well as in many expert problem solving tasks. Several efforts have been devoted recently to extend non disjunctive logic programming to perform abductive reasoning, such as [14, 17, 19, 22, 23, 24, 42, 43]. Abduction with logic programs can be used in various fields of AI, including default reasoning, diagnosis and legal reasoning. Two key forms of approaches to abduction are well known in the community of logic programming: consistency based abduction and argumentation based abduction. The first ....

Kakas,A., Kowalski,R. and Toni,F., Abductive Logic Programming, J. Logic and Computation, 2, pp.719-770,1992.

....account offered by the AGM and to the principles and insights identified therein. Abduction was chosen because it can be rendered logically in a way that fits nicely with the AGM and because it has been demonstrated to be an effective technique in many problem areas, including: database updates [57, 56], diagnostic reasoning [105] text understanding [123] and vision [14] We begin with a brief logical investigation of the notion of abduction. Using these insights we investigate the use of abduction in belief expansion, contraction and revision. Our emphasis here is on the normative aspects of ....

....the relevant explanations are always of the form R because P, and Q, explaining why or how it is that something is so. Achinstein (1983) points out that there are other sorts of abduction . Abducibles Another very popular restriction (especially among Logic Programming approaches [56]) is to ensure abductions consist of propositional or predicate symbols from a predetermined class. Such propositions and predicates are referred to as abducibles. One problem with this approach is that it may be difficult to determine which propositions and predicates should be deemed abducible. ....

[Article contains additional citation context not shown here]

Antonis C. Kakas, Robert A. Kowalski, and Francesca Toni. Abductive logic programming. In Dov M. Gabbay, editor, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, page (to appear). Oxford University Press, 1995. An updated version of [55].

....Equivalently, if the set of possible worlds of the expert is a possible world model of the theory. Consequently, the above proposition shows that for any embedding , D) is not a correct representation of D. 7 Knowledge theoretic analysis of ALP Abductive Logic Programming (ALP) is de ned in [16] as an extension of logic programming for performing abductive reasoning. Kakas, Kowalski and Toni de ne an abductive logic framework as a triple hA; P; T i of a set of predicates A called the abducible predicates, a logic program P with only non abducibles in the head, and a set T of FOL formulas ....

....and a set of ground abducible atoms such that: P [ j= 8( Q) P [ is a consistent logic program. P [ j= T 15 This de nition is parametric in the semantics of LP: each semantics de nes its own entailment relation j= its own notion of consistent program and of abductive solution. [16] also discusses two other variants of the de nition of abduction in which the constraints have a di erent role (the consistency view and the meta level view on constraints) The concern in this section is the epistemological foundation of ALP: what is the declarative reading of ALP An obvious ....

[Article contains additional citation context not shown here]

A. C. Kakas, R.A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719-770, 1993.

....deduction and induction) used in artificial intelligence and diagnostic methods. In the step two of our DLA model we used the abduction for setting the conditions of possible attack on the protocol. Let s look how it works. We assume that the reader is common with Abductive Logic Programming [12] Definition 5 (Abductive Theory) An abudctive theory in ALP (abductive logic programming) is a triple FC ,A,IC where FC is a logic program (representing evaluation of communication protocol C) A is a set of predicate symbols, called abducibles (in our case predicates about knowledge of keys ....

.... C, then the following holds: Every A computed answer is A correct answer in F C ,A,IC and for observation Messages(X,Y) soundness) Every A correct answer is A computed answer in F C ,A,IC and for observation Messages(X,Y) completeness) Proof: Standard Abductive Logic theory [12]. Definition 8 (ADepth computed answer) A set of instances of abducible predicates D is ADepth computed answer (abductive explanation) for abductive theory HC ,A,IC , HC is a logic program, that interprets evaluation of communicating protocol C, HC=F 1 F 2 H 3 F 4 PDF created with FinePrint ....

Kakas A.C., Michael A.: Abductive Logic Programming. Journal of Logic and Computation 2, (1993).

....with the intuition, we obtain that rains is an explanation of go fishing, as it is entailed by T # rains . In the context of logic programming, abduction has been first proposed by Kakas and Mancarella [13] and, during the recent years, common interest in the subject has been growing rapidly [4, 15, 13, 12, 6, 5, 20], also for the observation that, compared to deduction, this kind of reasoning has some advantages for dealing with incomplete information [5, 1] In this paper we study abduction with penalization in logic programming. This form of abductive reasoning, well studied in the setting of classical ....

A. Kakas and R. Kowalski and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--771, 1992.

....in database theory [Ullman, 1980] though for integrity checking rather than for reasoning. Integrity constraints themselvas (like those shown in example 7) have played a role both in database systems and in machine learning, expecially in the context of abductive logic programming (see e.g. [Kakas al, 1993] for the latter) Compilation of rules for more efficient future query processing has been considered both in the context of machine learning (under the heading of ExplanationBased Learning, see [Ellman, 1989] for an overview) and of expert systems and databases (where the so called semantic query ....

Kakas, A.C., Kowalski, R.A., Toni, F. Abductive logic programming. Journal of Logic and Computation, vol. 2, n. 6, 719--770, 1993.

....(for this reason we call them rambling agents) and collect information (i.e. the agent s experience) derived from the interactions with other agents in different bunches. More in detail each agent is characterized by statically defined local knowledge represented by an abductive logic program [9] and possibly a dynamically built set of assumptions (i.e. its experience) Rambling agents can contribute to enlarge the dynamic knowledge of bunches they enter. As well, each rambling agent can improve its experience by rambling from bunch to bunch by collecting the set of hypotheses produced ....

A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--770, 1993.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719-770, 1993.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719-770, 1993.

No context found.

A. C. Kakas and P. Mancarella. Abductive logic programming. In Proc. Workshop Logic Programming and Non-Monotonic Logic, 1990.

No context found.

A.C. Kakas, R.A. Kowalski, F. Toni, Abductive logic programming. Journal of Logic and Computation 2(6) (1993) pages 719-770

....4. 2 Abductive Logic Programming In this section we briefly review some of the elements of Abductive Logic Programming (ALP) needed for the formulation of the learning framework of Abductive Concept Learning (ACL) For a more detailed presentation of ALP the reader is referred to the survey [KKT93] and its recent update [KKT97] and references therein. Abductive Logic Programming is an extension of Logic Programming to support abductive reasoning with theories (logic programs) that incompletely describe their problem domain. In ALP this incomplete knowledge is captured (represented) by ....

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2:719--770, 1993.

....to address some of the limitations of deductive reasoning in classical logic. The role of abduction has been demonstrated in a variety of applications. It has been proposed as a reasoning paradigm in AI for diagnosis [8, 90] natural language understanding [8, 39, 4, 93] default reasoning [81, 29, 25, 50], planning [28, 110, 71, 59] knowledge assimilation and belief revision [54, 76] multi agent systems [7, 64, 102] and other problems. In the context of logic programming, the study of abductive inference started at the end of the eighties as an outcome of di#erent attempts to use logic ....

....[81] In [18, 14] abductive logic programming was investigated from a knowledge representation point of view and its suitability for representing and reasoning on incomplete information and definitional and assertional knowledge was shown. For these reasons, Abductive Logic Programming (ALP) [50, 51] was recognized as a promising computational paradigm that could resolve many limitations of logic programming with respect to higher level knowledge representation and reasoning tasks. ALP has manifested itself as a framework for declarative problem solving suitable for a broad collection of ....

[Article contains additional citation context not shown here]

Kakas, A. C., Kowalski, R. A., Toni, F., Abductive logic programming. Journal of Logic and Computation 2(6) (1993) 719--770

....and its potential benefits it has not been easy to develop general systems for abduction that are computationally effective for problems of practical size and complexity. System, that supports abductive reasoning within the framework of Abductive Logic Programming (ALP) Kakas et al. 1998; Denecker and Kakas, 2000] In this framework problems are represented in a high level declarative way with logic programming rules and classical first order sentences (integrity constraints) Our work aims to examine the possibility of developing ALP into a declarative problem solving framework, suitable for a variety ....

....that integrates together Abductive Logic Programming (ALP) with methods from Constraint Logic Programming (CLP) The A system is developed within this framework. Let us briefly review the underlying framework of ALP. A recent way to formalize ALP is to view this as a special case of ID logic [Denecker, 2000] , a logic extending classical logic with inductive definitions. Let a language of predicates, be given consisting of three disjoint types of predicates: i) the defined predicates, ii) the open or abducible predicates and (iii) the constraint predicates. Then a theory in ALP is ....

M. Denecker and A.C. Kakas. Abductive Logic Programming. Special issue of JLP, Vol 44 (1-3), 2000.

....for the open predicates in Def. Once M is determined, Def becomes a standard logic program, with a unique well founded model [42] This model is then a model of the whole theory T if it is also a model of Fol. ID logic is a generalization of the notion of abductive logic programs (ALP) [18]. For instance, the open predicates of a theory in ID logic correspond to the abducibles in an abductive logic program. Consequently, solutions of abductive logic programs that are computed by an abductive solver are also models of the corresponding ID logic theory. Here we use such a solver, ....

M. Denecker, A.C. Kakas. Abductive Logic Programming. J. Logic Programming (Special Issue on Abduction) 44 (1-3), 2000.

....describing the composition of databases in terms of open predicates insert and retract. The key property of this theory is that its abductive solutions describe the coherent compositions. Abductive reasoning on an ID logic theory can be performed by mapping it into an abductive logic program [8] under the extended well founded semantics [24] and applying an abductive inference procedure to it. An abductive logic program (ALP) is a triple T = P ; A; IC) such that P is a logic program, the clauses of which are interpreted as de nitions for the predicates in their head, A is a set ....

M. Denecker, A.C. Kakas. Abductive Logic Programming, Special issue of Journal of Logic Programming, 44 (1-3), 2000.

....identified a class of explanations, such as the class of h explanations in Definition 4.1, and a preference criterion such as that of Definition 4. 2, it is possible to construct a corresponding meta level, explanation based semantics similar to the semantics of Abductive Logic Programming [19] [20], 13] We consider all possible extensions of a given domain description D with optimal explanations, and accept conclusions if and only if these hold in each such extension. This semantics can then be used to decide what can be safely inferred from a seemingly inconsistent domain description. ....

....followed in this paper are based on a relatively simple use of normal logic programming and standard techniques within this. We could develop a more general implementation for computing entailment or i entailment using abductive logic programming, building on the work in [10] 11] 19] and [20]. The abductive flavour of our definition of h entailment suggests that abductive logic programming could be a useful implementation tool here as well. Thirdly, the expressivity of E could be increased in various ways. We have already briefly indicated how E might be extended to partially deal ....

Antonios Kakas, Robert Kowalski and Francesca Toni, Abductive logic programming, Journal of Logic and Computation vol. 2 no. 6, pages 719-770, 1993.

....in order to make it viable for applications is to interface appropriately to non monotonic systems specialized domain constraint solvers. This conclusion is based on some of our recent work where we have been trying to apply the non monotonic framework of Abductive Logic Programming(ALP) [5] to solve realistic application problems. We are making here the assumption that the same findings will hold for most if not all other non monotonic frameworks. This assumption is based on the fact that most of the non monotonic frameworks can be captured via abduction and we therefore believe ....

.... ABDUCTION Abduction has recently attracted a lot of attention as an appropriate form of reasoning for formulating many AI problems as such as diagnosis, temporal reasoning including planning, scheduling and temporal diagnosis, natural language processing and others (see the recent surveys [5], 8] Also abductive reasoning has been proven suitable for capturing logically different kinds of inferences such as explanation, non monotonic and default reasoning, knowledge assimilation and belief revision. This versatility of abduction as a reasoning paradigm together with the high level ....

[Article contains additional citation context not shown here]

A. C. Kakas, R. A. Kowalski and F. Toni, "Abductive Logic Programming", Journal of Logic and Computation, 2(6), 719-770, 1993.

....to address some of the limitations of deductive reasoning in classical logic. The role of abduction has been demonstrated in a variety of applications. It has been proposed as a reasoning paradigm in AI for diagnosis [6, 79] natural language understanding [6, 33, 3, 81] default reasoning [70, 24, 20, 43], planning [23, 97, 61, 51] knowledge assimilation and belief revision [47, 65] multi agent coordination [5, 55] and other problems. In the context of logic programming, the study of abductive inference started at the end of the eighties as an outcome of di erent attempts to use logic ....

....[70] In [13, 11] abductive logic programming was investigated from a knowledge representation point of view and its suitability for representing and reasoning on incomplete information and de nitional and assertional knowledge was shown. For these reasons, Abductive Logic Programming 1 (ALP) [43, 44] was recognised as a promising computational paradigm that could resolve many limitations of logic programming with respect to higher level knowledge representation and reasoning tasks. ALP has manifested itself as a framework for declarative problem solving suitable for a broad collection of ....

[Article contains additional citation context not shown here]

Kakas, A. C., Kowalski, R. A., Toni, F., Abductive logic programming. Journal of Logic and Computation 2(6) (1993) 719-770 24

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni, "Abductive Logic Programming, " Journal of Logic and Computation, vol. 2, no. 6, pp. 719--770, 1993.

No context found.

KAKAS, A. C., KOWALSKI , R. A., AND TONI, F. 1992. Abductive logic programming. Journal of Logic and Computation 2, 6, 719--770.

No context found.

Kakas, A., Kowalski, R., Toni, F.: Abductive Logic Programming, Journal of Logic and Computation, 2(6), 1993, 718--770.

No context found.

A.C. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6), 1993. 718--770.

No context found.

Kakas A.C., Kowalski R.A., and Toni F.: Abductive logic programming. Journal of Logic and Computation 2, 6, pp. 719-770, 1992.

No context found.

Kakas, Antonis C., Kowalski, Robert A., & Toni, Francesca. (1993). Abductive logic programming. Journal of logic and computation, 2, 719--770.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719--770, 1992.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719--770, 1992.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive Logic Programming. J. of Logic and Computation, 2(6):719--770, 1993.

No context found.

Kakas, A.C., Mancarella, P.: Abductive logic programming. In Marek, V.W., Nerode, A., Pedreschi, D., Subrahmanian, V.S., eds.: Proceedings of the Workshop Logic Programming and Non-Monotonic Logic, Austin, TX (1990) 49--61

No context found.

A. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2:719--770, 1993.

No context found.

A. C. Kakas, R.A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--770, 1992.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--770, 1993.

No context found.

A. Kakas, R. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 1993.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. J. of Logic and Computation, 2:719-770, 1992.

No context found.

A.C. Kakas, R.A.Kowalski, F. Toni. `Abductive Logic Programming ', Journal of Logic and Computation 2(6) (1993) 719-770.

No context found.

A Kakas, R Kowalski, and F Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719--770, 1992.

No context found.

A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive logic programming. In Journal of Logic and Computation, 2(6), pp. 719-770, 1992.

No context found.

A. Kakas, R. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 1993.

No context found.

Antonis C. Kakas, Robert A. Kowalski, and Francesca Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719--770, 1992.

No context found.

A Kakas, R Kowalski, and F Toni. Abductive logic programming. Journal of Logic and Computation, 2:719--707, 1993.

No context found.

Antonis C. Kakas, Robert A. Kowalski, and Francesca Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719--770, 1993.

No context found.

A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2#6#:719#770, 1993.

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