Search
Skip to Search Results- 10Pelletier, Francis J.
- 1Delgrande, James
- 1Elio, Renée
- 1Jin, Yi
- 1Rudnicki, Piotr
- 1Schubert, Lenhart K.
-
2008
Pelletier, Francis J., Jin, Yi, Delgrande, James
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update...
-
1997
Pelletier, Francis J., Elio, Renée
This study examines the problem of belief revision, defined as deciding which of several initially accepted sentences to disbelieve, when new information presents a logical inconsistency with the initial set. In the first three experiments, the initial sentence set included a conditional...
-
1995
Pelletier, Francis J., Sutcliffe, Geoff
Introduction: In 1986 Pelletier published an annotated list of logic problems, intended as an aid for students, developers, and researchers to test their automated theorem proving (ATP) systems. The 75 problems in the list are subdivided into propositional logic (Problems 1-17), monadic-predicate...
-
1986
Pelletier, Francis J., Rudnicki, Piotr
Introduction: Some problems that are difficult for automated theorem provers (ATPs) are so merely because of their size, but not because of any logical or conceptual complexity. Examples of this type of difficult problem have been published in the past: see Pelletier [1986: problems 12, 29, 34,...
-
1985
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update...
-
1984
P.P. Gibbins closes his article (\"The Strange Modal Logic of Indeterminacy\" Logique et Analyse #100 :443446) with \"But indeterminacy generates a strange modal logic. The semantical business of there being classes of indeterminate worlds accessible to no worlds not even to themselves is strange...
-
1982
Pelletier, Francis J., Schubert, Lenhart K.
Introduction: We describe an approach to parsing and logical translation that was inspired by Gazdar's work on context-free grammar for English. Each grammar rule consists of a syntactic part that specifies an acceptable fragment of a parse tree, and a semantic part that specifies how the logical...
-
1980
One way of 'restricting linguistic theory' is the L-view: place sufficient restrictions on the allowable rules of grammars so as to reduce their generative power. Another way is the G-view: disallow certain grammars, regardless of whether this results in a reduction of generative capacity. The...
-
1977
It is an extremely popular view among logicians and some linguists (McCawley, Hurford) that there are two distinct or's in English - an \"inclusive\" and an \"exclusive\". It seems equally popular among lexicographers, experts on proper usage, and some linguists (R. Lakoff) that there is only...