Sökning: "Entailment"
Visar resultat 1 - 5 av 12 avhandlingar innehållade ordet Entailment.
1. Studies on Factivity, Complementation, and Propositional Attitudes
Sammanfattning : This dissertation is a collection of seven papers in which a number of questions are investigated regarding verbs that take a sentential complement as their direct object. These verbs are considered from different perspectives, namely from the perspective of the propositional attitude they express, or from the perspective of the syntactic construction they select, or from the point of view of the implications to which they might give rise. LÄS MER
2. The Evaluability Hypothesis : The Syntax and Semantics of Polarity Item Licensing in Swedish
Sammanfattning : This dissertation is concerned with the empirical and theoretical aspects of polarity item licensing in Swedish. I argue that polarity items are semantically sensitive to evaluability, a concept that refers to the possibility of accepting or rejecting a clause as true in a communicative exchange. Clauses are either evaluable or non-evaluable. LÄS MER
3. Reasoning about concurrent actions in the trajectory semantics
Sammanfattning : We have introduced concurrency into the framework of Sandewall. The resulting formalism is capable of reasoning about interdependent as well as independent concurrent actions. LÄS MER
4. Principle-based non-monotonic reasoning - from humans to machines
Sammanfattning : A key challenge when developing intelligent agents is to instill behavior into computing systems that can be considered as intelligent from a common-sense perspective. Such behavior requires agents to diverge from typical decision-making algorithms that strive to maximize simple and often one-dimensional metrics. LÄS MER
5. Automatic Verification of Petri Netsin a CLP framework
Sammanfattning : This thesis presents an approach to automatic verification of Petri Nets. The method is formulated in a CLP framework and the class of systems we consider is characterized syntactically as a special class of Constraint Logic Programs. The state space of the system in question coincides with the least fixpoint of the program. LÄS MER