• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 134
  • 34
  • 8
  • 6
  • 4
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 246
  • 246
  • 82
  • 50
  • 40
  • 37
  • 36
  • 33
  • 29
  • 28
  • 27
  • 26
  • 23
  • 23
  • 22
  • 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.
41

From Z to C : illustration of a rigorous development method

Neilson, D. S. January 1989 (has links)
No description available.
42

Forgetting in logic programs

Wong, Ka-Shu, Computer Science & Engineering, Faculty of Engineering, UNSW January 2009 (has links)
Forgetting is an operation which removes information from a set of logical statements, such that a) the language used by the logic is simplified; and b) as much information as possible from the original logical statements are preserved. Forgetting operations are useful in a variety of contexts, including knowledge representation, where it is necessary to have an operation for removing information from knowledge bases; and the problem of relevance, where logical statements are simplified by removing irrelevant information. In this thesis we consider forgetting operations on logic programs with negation-as-failure according to the stable model semantics. There are existing notions of forgetting on logic programs in the literature: the strong forgetting and weak forgetting of Zhang and Foo, and the semantic approach to forgetting introduced by Wang et al. However, these notions are inadequate: the strong and weak forgettings are defined syntactically with no obvious connections to semantic notions of forgetting; while the semantic approach of Wang et al. does not take into account ``hidden'' information encoded in unused rules. The idea of equivalence on logic programs capture the extent of information contained in a logic program. We consider that two logic programs are equivalent iff the two programs contain the same information. For logic programs, there are many different possible notions of equivalence. We look at the well-known notion of strong equivalence and a new notion of equivalence which we call T-equivalence. Associated with each of these equivalences is a consequence relation on logic program rules. We present sound and complete set of inference rules for both consequence relations. We present a novel approach to logic program forgetting which uses as its basis a set of postulates, which are defined relative to a notion of equivalence. We show that if we use T-equivalence as the equivalence relation, then the only possible forgetting operations (up to equivalence) are strong forgetting and weak forgetting. If strong equivalence is used instead, then there are also only two possible forgetting operations (up to equivalence).
43

Answer set programming with clause learning

Ward, Jeffrey Alan, January 2004 (has links)
Thesis (Ph. D.)--Ohio State University, 2004. / Title from first page of PDF file. Document formatted into pages; contains xv, 170 p. : ill. Advisors: Timothy J. Long and John S. Schlipf, Department of Computer Science and Engineering. Includes bibliographical references (p. 165-170).
44

Answer set programming : SAT based solver and phase transition /

Zhao, Yuting. January 2003 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 104-112). Also available in electronic version. Access restricted to campus users.
45

Application of formal methods to digital system design

Herbert, J. M. J. January 1986 (has links)
No description available.
46

Type-driven natural language analysis

Pareschi, Remo January 1988 (has links)
No description available.
47

A constraint-based partial evaluator for functional logic programs and its application

Lafave, Laura January 1998 (has links)
No description available.
48

An axiomatic approach to deductive object-oriented databases

Antunes Fernandes, Alvaro Adolfo January 1995 (has links)
No description available.
49

Execution of Prolog by transformations on distributed memory multi-processors

Xirogiannis, George January 1998 (has links)
No description available.
50

Logic programming with constraints

Liu, Guohua Unknown Date
No description available.

Page generated in 0.1206 seconds