-
Michael Bratman.
Intentions, Plans, and Practical Reason.
Harvard University Press,
1987.
Keywords:
intentionality,
belief desires intentions,
BDI,
honours reading.
@Book{Bratman1987,
author = "Michael Bratman",
title = "Intentions, Plans, and Practical Reason",
publisher = "Harvard University Press",
keywords = "intentionality, belief desires intentions, BDI, honours reading",
year = "1987",
}
-
John Wylie Lloyd.
Foundations of Logic Programming.
Springer-Verlag,
New York, NY, USA,
1987.
Keywords:
logic programming,
honours reading.
@Book{Lloyd1987,
author = "John Wylie Lloyd",
title = "Foundations of Logic Programming",
publisher = "Springer-Verlag",
address = "New York, NY, USA",
keywords = "logic programming, honours reading",
year = "1987",
}
-
Lucille Alice Suchman.
Plans and situated actions : the problem of human-machine communication.
Cambridge University Press,
Cambridge [Cambridgeshire] ; New York,
1987.
Note: 87008013 //r96 Lucy A. Suchman. Includes indexes. Bibliography: p. 190-197.
Keywords:
cognitive science,
intentionality,
honours reading.
@Book{Suchman1987,
author = "Lucille Alice Suchman",
title = "Plans and situated actions : the problem of human-machine communication",
publisher = "Cambridge University Press",
address = "Cambridge [Cambridgeshire] ; New York",
note = "87008013 //r96 Lucy A. Suchman. Includes indexes. Bibliography: p. 190-197.",
keywords = "cognitive science, intentionality, honours reading",
year = "1987",
}
-
N. Immerman.
Languages that capture complexity classes.
SIAM Journal on Computing,
16(4):760--78,
1987.
Note: USA.
Keywords:
computational complexity,
honours reading.
| Abstract: |
"The author presents a series of operators of apparently increasing power which when added to first-order logic produce a series of languages in which exactly the properties checkable in a certain complexity class may be expressed. He gives alternate characterizations of the most important complexity classes. He also introduces reductions appropriate for the setting: first-order translations, and a restricted, quantifier free version of these called projection translations. He shows that projection translations are a uniform version of Valiant's projections, and that the usual complete problems remain complete via these very restrictive reductions. (30 References)." |
@Article{Immerman1987,
author = "N. Immerman",
title = "Languages that capture complexity classes",
journal = "SIAM Journal on Computing",
volume = "16",
number = "4",
pages = "760--78",
note = "USA.",
abstract = "The author presents a series of operators of apparently increasing power which when added to first-order logic produce a series of languages in which exactly the properties checkable in a certain complexity class may be expressed. He gives alternate characterizations of the most important complexity classes. He also introduces reductions appropriate for the setting: first-order translations, and a restricted, quantifier free version of these called projection translations. He shows that projection translations are a uniform version of Valiant's projections, and that the usual complete problems remain complete via these very restrictive reductions. (30 References).",
keywords = "computational complexity, honours reading",
year = "1987",
}
-
H. J. Levesque and R. J. Brachman.
Expressiveness and tractability in knowledge representation and reasoning.
Computational Intelligence,
3(2):78--93,
1987.
Note: Canada.
Keywords:
computational complexity,
proof theory,
honours reading.
| Abstract: |
"A fundamental computational limit on automated reasoning and its effect on knowledge representation is examined. Basically, the problem is that it can be more difficult to reason correctly with one representational language than with another and, moreover, that this difficulty increases dramatically as the expressive power of the language increases. This leads to a tradeoff between the expressiveness of a representational language and its computational tractability. It is shown that this tradeoff can be seen to underlie the differences among a number of existing representational formalisms, in addition to motivating many of the current research issues in knowledge representation. (37 References)." |
@Article{Levesque1987,
author = "H. J. Levesque and R. J. Brachman",
title = "Expressiveness and tractability in knowledge representation and reasoning",
journal = "Computational Intelligence",
volume = "3",
number = "2",
pages = "78--93",
note = "Canada.",
abstract = "A fundamental computational limit on automated reasoning and its effect on knowledge representation is examined. Basically, the problem is that it can be more difficult to reason correctly with one representational language than with another and, moreover, that this difficulty increases dramatically as the expressive power of the language increases. This leads to a tradeoff between the expressiveness of a representational language and its computational tractability. It is shown that this tradeoff can be seen to underlie the differences among a number of existing representational formalisms, in addition to motivating many of the current research issues in knowledge representation. (37 References).",
keywords = "computational complexity, proof theory, honours reading",
year = "1987",
}
-
H. J. Levesque and R. J. Brachman.
Expressiveness and tractability in knowledge representation and reasoning Computational Intelligence journal.
3:78--93,
1987.
Keywords:
honours reading,
computational complexity.
@Article{Levesque1987b,
author = "H. J. Levesque and R. J. Brachman",
title = "Expressiveness and tractability in knowledge representation and reasoning Computational Intelligence journal",
volume = "3",
pages = "78--93",
keywords = "honours reading, computational complexity",
year = "1987",
}