41 
Application of formal methods to digital system designHerbert, J. M. J. January 1986 (has links)
No description available.

42 
Typedriven natural language analysisPareschi, Remo January 1988 (has links)
No description available.

43 
A constraintbased partial evaluator for functional logic programs and its applicationLafave, Laura January 1998 (has links)
No description available.

44 
An axiomatic approach to deductive objectoriented databasesAntunes Fernandes, Alvaro Adolfo January 1995 (has links)
No description available.

45 
Execution of Prolog by transformations on distributed memory multiprocessorsXirogiannis, George January 1998 (has links)
No description available.

46 
Forgetting in logic programsWong, KaShu, 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 negationasfailure 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 wellknown notion of strong equivalence and a new notion of equivalence which we call Tequivalence. 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 Tequivalence 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).

47 
Forgetting in logic programsWong, KaShu, 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 negationasfailure 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 wellknown notion of strong equivalence and a new notion of equivalence which we call Tequivalence. 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 Tequivalence 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).

48 
Answer set programming with clause learningWard, 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. 165170).

49 
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 104112). Also available in electronic version. Access restricted to campus users.

50 
Logic programming with constraintsLiu, Guohua Unknown Date
No description available.

Page generated in 0.2044 seconds