NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 4
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 4 of 4 (0.014 seconds)
1

Logics for resource-bounded agents

Jago, Mark January 2006 (has links)
No description available.
004.015113
2

Games for syntactic control of interference

Wall, Matthew January 2004 (has links)
No description available.
004.015113
3

Circumscriptive reasoning

Halland, Kenneth John 08 1900 (has links)
We show how the non-monotonic nature of common-sense reasoning can be formalised by circumscription. Various forms of circumscription are discussed. A new form of circumscription, namely naive circumscription, is introduced in order to facilitate the comparison of the various forms. Finally, some issues connected with the automation of circumscriptive reasoning are examined. / Computing / M. Sc. (Computer Science)
Circumscription
Common-sense reasoning
Non-monotonic logic
Models
Satisfiability
Soundness
Completeness
Minimal models
Scope
Theorem-proving algorithms
004.015113
Logic, Symbolic and mathematical
4

Circumscriptive reasoning

Halland, Kenneth John 08 1900 (has links)
We show how the non-monotonic nature of common-sense reasoning can be formalised by circumscription. Various forms of circumscription are discussed. A new form of circumscription, namely naive circumscription, is introduced in order to facilitate the comparison of the various forms. Finally, some issues connected with the automation of circumscriptive reasoning are examined. / Computing / M. Sc. (Computer Science)
Circumscription
Common-sense reasoning
Non-monotonic logic
Models
Satisfiability
Soundness
Completeness
Minimal models
Scope
Theorem-proving algorithms
004.015113
Logic, Symbolic and mathematical

Page generated in 0.0347 seconds