Exercise 6.1:
Modify the depth-bound meta-interpreter (below) so that
the bound is on the total length of the proof, where the length is the total number of
instances of base-level atoms that appear in the proof.
Different base-level atoms can incur different costs on the bound. For example, most
atoms could have zero cost, and some atoms could incur a positive code.
Depth-bounded meta-interpreter:
bprove(true, D).
bprove((A & B), D) <- bprove(A, D) Ù (bprove(B, D).
bprove(H, D) <- D ≥_ Ù D1 is D-1 Ù (H <= B) Ù bprove(B, D1)
Exercise 6.2:
The program of Figure 6.7 (below) allows duplicate delayed goals. Write a version of dprove that returns minimal sets of delayed goals, in their simplest forms.
Exercise 6.3:
Explain the difference between using a symbolic debugger for a programming language like C and using the explanation facility of an expert system. Discuss what needs to be known in order to use either debugging tool.
Dynamic Probes (Dprobes) is a generic and pervasive system debugging facility that will operate under the most extreme software conditions such as debugging a deep-rooted operating system problem in a live environment. Dprobes allows the insertion of fully automated breakpoints or probepoints anywhere in the system and user space. Each probepoint has an associated set of probe instructions that are interpreted when the probe fires. These instructions allow memory and CPU registers to be examined and altered using conditional logic. When the probe command terminates, prior to returning to the probed code, a syslog record may be optionally generated.
찾아봐도 그런건 없네요.어디서 그런 명령을 보셨는지 힌트를 주시거나
찾아봐도 그런건 없네요.
어디서 그런 명령을 보셨는지 힌트를 주시거나 어떤 작업을 하시다가 그런 툴이
필요한건지 정도의 힌트는 주셔도 되지 않을까요?
혹시 prove를 말하는건 아닌지...
man prove해보세요.
------------------------------
좋은 하루 되세요.
embeded linux 수업을 듣다가..
임베디드 리눅스 수업을 듣다가 교수님께서
여러가지 디버깅 툴에 대해서 레포트를 하라고 하셨는데
필수적으로 하라고 한 툴이 dprove였습니다.
그 외에 gdb, ltrace, ptrace, strace 중에 선택해서 하라고 하셨
습니다. 전화로 다시 물어봐도 dprove라는 툴이 있다고 하시니
난감할 따름입니다. -_- 도저히 검색해도 않나오네요.. 일단 소스
가 있어야 살펴보기라도 할텐데 검색조차 않되니ㅡㅡ;
나에게 있어 한계란 없다.
무한한 꿈을향해 나아간다.
설마 이건 아니겠져
Wintersemester 2002/2003 Bernd Neumann
‹bungen zur Vorlesung: Wissensbasierte Systeme
Blatt 6
Exercise 6.1:
Modify the depth-bound meta-interpreter (below) so that
the bound is on the total length of the proof, where the length is the total number of
instances of base-level atoms that appear in the proof.
Different base-level atoms can incur different costs on the bound. For example, most
atoms could have zero cost, and some atoms could incur a positive code.
Depth-bounded meta-interpreter:
bprove(true, D).
bprove((A & B), D) <- bprove(A, D) Ù (bprove(B, D).
bprove(H, D) <- D ≥_ Ù D1 is D-1 Ù (H <= B) Ù bprove(B, D1)
Exercise 6.2:
The program of Figure 6.7 (below) allows duplicate delayed goals. Write a version of dprove that returns minimal sets of delayed goals, in their simplest forms.
Meta-interpreter for delayed goals:
dprove(true, D, D).
dprove((A & B), D1, D3) <- dprove(A, D1, D2) Ù dprove(B, D2, D3).
dprove(G, D, [G | D]) <- delay(G).
dprove(H, D1, D2) <- (H <= B) Ù dprove(B, D1, D2).
Exercise 6.3:
Explain the difference between using a symbolic debugger for a programming language like C and using the explanation facility of an expert system. Discuss what needs to be known in order to use either debugging tool.
즐린
Dynamic Probes (Dprobes) is a generic an
Dynamic Probes (Dprobes) is a generic and pervasive system debugging facility that will operate under the most extreme software conditions such as debugging a deep-rooted operating system problem in a live environment. Dprobes allows the insertion of fully automated breakpoints or probepoints anywhere in the system and user space. Each probepoint has an associated set of probe instructions that are interpreted when the probe fires. These instructions allow memory and CPU registers to be examined and altered using conditional logic. When the probe command terminates, prior to returning to the probed code, a syslog record may be optionally generated.
http://freshmeat.net/projects/dprobes/
----
LUX ET VERITAS | Just for Fun!
댓글 달기