Syntactic Conditions for Antichain Property in CR-Prolog
|
|
- Robert Thompson
- 5 years ago
- Views:
Transcription
1 This version: 2017/05/21 Revising my paper before submitting for publication. Syntactic Conditions for Antichain Property in CR-Prolog Vu Phan Texas Tech University Abstract We study syntactic conditions which guarantee when a Consistency Restoring Prolog program has antichain property (no answer set is a proper subset of another). A notable such condition is that the program s dependency graph being acyclic and having no directed path from one cr-rule head literal to another. Contents 1 Introduction 1 2 CR-Prolog Syntax Semantics Preliminary Results Up to One CR-Rule Unique CR-Literals Main Results Dependency Graphs Same Abductive Support Heads CR-Independence and Acyclicity Conclusion 15 6 Acknowledgment 15 1 Introduction Answer Set Prolog (A-Prolog) is a programming language for knowledge representation and reasoning (Gelfond and Lifschitz [1988]). An A-Prolog program comprises rules which determine the sets of beliefs that a logical agent can hold. A-Prolog relies on the stable model semantics of logic programs with negation. Page 1 of 16
2 Consistency Restoring Prolog (CR-Prolog) extends A-Prolog with cr-rules (Balduccini and Gelfond [2003]). The cr-rules apply only when the regular rules alone result in a contradiction. These cr-rules are meant to represent exceptions which are very rare but still possible. A-Prolog and its extension CR-Prolog have been applied to solve problems in various fields (Erdem et al. [2016]). For instance, a logic program was used to guide multiple robots to collaboratively tidy up a house. Also, a tourism application suggested trips based on user preferences. In this paper, we investigate the antichain property that a logic program might have: no answer set is a proper subset of another. Every A-Prolog program has antichain property. However, there exist CR-Prolog programs without antichain property. We look at some syntactic conditions guaranteeing that a CR-Prolog program has this desired semantic property. Such conditions are specified in Theorem (most notable) as well as Theorem 3.1.4, Corollary 3.1.7, and Propositions & CR-Prolog The complete specifications of A-Prolog and CR-Prolog can be found in [Gelfond and Kahl, 2014, Sections 2.1 & 2.2 & 5.5]. 2.1 Syntax Definition An atom represents a boolean value. A literal is either an atom a or its classical-negation a. An extended literal is either a literal l or its default-negation not l. Definition (Regular Rule). A regular rule r has the form: l 1 or... or l k l k+1,..., l m, not l m+1,..., not l n. Each l i above is a literal and 1 k m n. 1 The head of r is the disjunction of literals before. The body of r is the conjunction of extended literals after. Definition (CR-Rule). Similar to a regular rule, a cr-rule has the form: 1 If k = m = n, then the rule can be shortened to: l 0 + l1,..., l m, not l m+1,..., not l n. l 1 or... or l k. Page 2 of 16
3 Definition (A-Prolog Program). An A-Prolog program is a finite set of regular rules. Definition (CR-Prolog Program). A CR-Prolog program is a finite set of regular rules and cr-rules. Notations: Π reg and Π cr denote the corresponding subsets of regular rules and cr-rules. Definition (Applications of CR-Rules). Let r be a cr-rule. Then the application α(r) is the regular rule obtained from r by replacing + with. If R is a set of cr-rules, then let α(r) = {α(r) : r R}. When R is a subset of a CR-Prolog program Π, let Π R = Π reg α(r). 2.2 Semantics Definition (Context). Literals l and l are complementary if l = l. A set S of literals is a context if S contains no pair of complementary literals. Definition (Satisfiability). A context S satisfies: 1. a literal l if l S 2. an extended literal not l if l / S 3. a disjunction l 1 or... or l k if some l i S 4. a conjunction l k+1,..., l m, not l m+1,..., not l n if S satisfies all conjuncts (which are extended literals) 5. a rule r if S satisfies the head of r whenever S satisfies the body of r Definition (A-Prolog Answer Set). Definition (CR-Prolog Answer Set). We study the CR-Prolog variant in which minimality of abductive supports is based on cardinality. Definition (Antichain Property). Let Π be a CR-Prolog program. We say Π has antichain property if: for all answer sets S 1 and S 2 of Π, we have S 1 S 2 S 1 = S 2. Example (CR-Prolog Program without Antichain Property). Consider the following program: a. a not b, not c. b c. b +. (r 1 ) c +. (r 2 ) This program has answer sets S 1 = {a, b} and S 2 = {a, b, c}. Observe that S 1 S 2 (proper subset). The corresponding abductive supports are R 1 = {r 1 } and R 2 = {r 2 }. Page 3 of 16
4 3 Preliminary Results 3.1 Up to One CR-Rule Remark Every inconsistent CR-Prolog program vacuously has antichain property. So only consistent programs are of interest. Definition (Reduct). Let R be a set of regular rules and S be a context. We write R S for the reduct of R wrt S. Lemma Let Π be an A-Prolog program. Let S 1 and S 2 be consistent sets of literals. If S 1 S 2, then Π S 2 ΠS 1. Proof. Assume Π S 2 The corresponding rule in Π is: has an arbitrary rule r: l 1 or... or l k l k+1,..., l m. l 1 or... or l k l k+1,..., l m, not l m+1,..., not l n. For each i in {m + 1,..., n}, we have l i / S 2, so l i / S 1 (as S 1 S 2 ). Therefore, r is also a rule in Π S 1. Theorem (Antichain Property of A-Prolog Programs, proved by Dr. Michael Gelfond). Let Π be an A-Prolog program. Let S 1 S 2 be answer sets of Π. Then S 1 = S 2. Proof. We will show S 2 S First, S 2 is an answer set of Π S 2. So S 2 is a minimal (wrt set inclusion) context which satisfies Π S 2. We shall prove S 2 S 1 by showing S 1 also satisfies Π S By 3.1.3, we have Π S 2 ΠS 1. Because S 1 satisfies Π S 1, we know S 1 also satisfies Π S 2. Definition (Equivalence of CR-Prolog Programs). Let Π 1 and Π 2 be CR-Prolog programs. We say Π 1 and Π 2 are equivalent, denoted by Π 1 Π 2, when S is an answer set of Π 1 iff S is an answer set of Π 2 for every context S. Remark Let Π be a CR-Prolog program. If Π reg is consistent, then Π is equivalent to Π reg, which has antichain property due to Theorem The interesting case is when Π reg is inconsistent. Corollary Let Π be a CR-Prolog program where Π reg is inconsistent. If Π has only one cr-rule, then Π has antichain property. Proof. Assume Π cr = {r} for some cr-rule r. Then Π is equivalent to the A-Prolog program Π {r} = Π reg α({r}). Simply apply Theorem to Π {r}. Page 4 of 16
5 3.2 Unique CR-Literals Definition (Useless Regular Rule). Let Π be an A-Prolog program containing some rule r. For an answer set S of Π, we say r is useless wrt S if S is an answer set of Π \ {r}. Definition (Regular Rule Firing). Given a regular rule r and a context S, we say r fires wrt S if S satisfies the body of r. Lemma Let r be a regular rule and S be a context. Assume {r} S = {r } for some default-negation-free rule r. Then r fires iff r fires, wrt S. Proof. The two rules are: l 1 or... or l k l k+1,..., l m, not l m+1,..., not l n. (r) l 1 or... or l k l k+1,..., l m. (r ) By construction of r from r, we know l i S for all i {m + 1,..., n}. Then r fires wrt S iff l i S for all i {k + 1,..., m} iff r fires wrt S. Remark Let r be a regular default-negation-free rule and S 1 S 2 be contexts. If r fires wrt S 1, then r fires wrt S 2. Lemma Let Π be an A-Prolog program containing some rule r. Let S be an answer set of Π. If r does not fire, then r is useless, wrt S. Proof. Let Π 1 = Π S and Π 2 = (Π \ {r}) S. We know S is an answer set of Π 1. We will prove S is an answer set of Π First, S satisfies Π 1. Notice Π 2 Π 1. Then S satisfies Π Assume some context S S also satisfies Π 2. We shall show S = S Case 1 of 2: {r} S =. Then Π 1 = Π 2, so S satisfies Π Case 2 of 2: {r} S = {r } for some default-negation-free rule r. Recall that we hypothesized r does not fire wrt S. By Lemma 3.2.3, we know r does not fire wrt S. Since S S, using the contrapositive of Remark 3.2.4, we deduce that r does not fire wrt S. Then S vacuously satisfies r. So S satisfies Π 1 = Π 2 {r }. In both cases, S satisfies Π 1. As S is an answer set of Π 1, due to minimality, we know S S. Since we assumed S S, we can now conclude that S = S. 3. We have shown that S is a minimal consistent set of literals which satisfies Π 2. Hence, S is an answer set of Π 2. Page 5 of 16
6 Lemma Let Π be a CR-Prolog program. Let S be an answer set of Π and R be a corresponding abductive support. Let cr-rule r R. Then α(r) is not useless wrt S. Proof. By way of contradiction, assume α(r) is useless wrt S. Let Π R = Π reg α(r). Then S is an answer set of Π R \ {α(r)}, whereas this program is precisely Π R = Π reg α(r ) with R = R \ {r}. So Π R is consistent. Since R is a minimal (wrt cardinality) set of cr-rules whose applications make Π consistent, we have R R. However, R = R 1 (recall R = R \ {r}), contradiction. Lemma Let Π be a CR-Prolog program. Let S be an answer set of Π and R be a corresponding abductive support. Let cr-rule r R. Then the application α(r) fires wrt S. Proof. First, S is an answer set of Π R = Π reg α(r). By way of contradiction, assume there exists some cr-rule r R such that α(r) does not fire wrt S. By Lemma 3.2.5, α(r) is useless wrt S. However, by 3.2.6, α(r) is not useless wrt S, contradiction. Definition (Head). If r is a rule, then let head(r) denotes the set of literals which appear in the head of r. If R is a set of rules, then let head(r) = r R head(r). Definition (Supported Literal). Let r be a regular rule, l be a literal, and S be a context. We say l is supported by r wrt S if all of the following hold: 1. r fires wrt S 2. head(r) S = {l} [Gelfond and Kahl, 2014, page 43, Proposition 2.2.1] Proposition Let Π be a CR-Prolog program. If the literal in the head of each cr-rule does not appear in the head of any other rule, then Π has antichain property. Proof. Let S 1 and S 2 be answer sets of Π. Assume S 1 S 2. We will show S 1 = S Let R 1 and R 2 respectively be abductive supports for S 1 and S 2. We first prove R 1 R 2. Let r be an arbitrary cr-rule in R 1. By Lemma 3.2.7, r fires wrt S 1, and S 1 satisfies head(r) = {l} where l is a literal. So l S 1, then l S 2 (as S 1 S 2 ). By the hypothesized syntactic condition, r is the sole rule in Π whose head contains l. Then only r can support l wrt S 2. So r R Now that we showed R 1 R 2, recall R 1 = R 2, as both are abductive supports. Then R 1 = R 2, since they are finite sets. Consequently, Π R1 = Π reg α(r 1 ) equals Π R2 = Π reg α(r 2 ). So S 1 and S 2 are answer sets of the same A-Prolog program. By Theorem 3.1.4, S 1 = S 2. Page 6 of 16
7 4 Main Results 4.1 Dependency Graphs Definition (Positive Body of Rule). Let r be a rule. The positive body of r, denoted by body + (r), is the set of literals in the body of r which are default-negation-free. Definition (Dependency Graph). Let Π be a CR-Prolog program. Let G Π be a graph whose vertices are literals of Π. For each pair of vertices l 1 and l 2 of G Π, there is a directed edge to l 1 from l 2 if Π has some rule r where l 1 head(r) and l 2 body + (r). We say G Π is the dependency graph of Π. Note: a self-loop forms a directed cycle. Remark (Answer Set of Acyclic Program). Let Π be an acyclic A-Prolog program and S be a context. Then S is an answer set of Π iff every literal in S is supported by a rule in Π wrt S [Ben-Eliyahu and Dechter, 1994, page 58, Theorem 2.7]. Example (Self-Loop Forming Cycle). To the contrary, assume a self-loop does not form a cycle. Consider this A-Prolog program: l l. (r) Let S = {l}. Notice that l is supported by r wrt S. However, S is not an answer set of Π. Then Remark is wrong, contradiction. Definition (Head-Cycle). Let Π be a CR-Prolog program with dependency graph G Π. Let C be a cycle in G Π. Assume: 1. vertices l 1 and l 2 are in C 2. there exists r Π where l 1 and l 2 are in head(r) Then C is a head-cycle in Π. Definition (Dependent Literals). Let Π be a CR-Prolog program with dependency graph G Π. Let l 1 and l 2 be two literals appearing in Π. We say l 1 depends on l 2 if G Π has a directed path to l 1 from l 2. Definition (CR-Literal). Let Π be CR-Prolog program with cr-rule r where head(r) = {l}. We say l is a cr-literal of Π. Definition (CR-Independence). Let Π be a CR-Prolog program. Then Π is cr-independent if l 1 does not depend on l 2 for all cr-literals l 1 and l 2. Page 7 of 16
8 4.2 Same Abductive Support Heads Remark Let Π be a CR-Prolog program with some answer set S. Then S head(π). Remark Let r be a regular rule and S be a consistent set of literals. If r fires wrt S, then {r} S. Remark Let Π be a CR-Prolog program with some answer set S and a corresponding abductive support R. Let cr-rule r R. Then {α(r)} S. (Use Lemma and Remark ) Example Consider an inconsistent A-Prolog program Π: l not l. Let S = {l}. Notice S is a minimal context which satisfies Π. However, S is not an answer set of Π, because S nonminimally satisfies Π S =. (Note that S = satisfies neither Π nor Π S = {l.}.) Example Consider a consistent CR-Prolog program Π: not l 1, not l 2. l 1 + not l2. (r) Then R = {r} is an abductive support of Π. Indeed, let Π R = Π reg α(r), then S = {l 1 } is an answer set of Π R S = {l 1 }. Notice S = {l 2 } satisfies Π R, but l 1 S. Lemma Let Π be a nondisjunctive default-negation-free A-Prolog program. If contexts S 1 and S 2 satisfy Π, then S 0 = S 1 S 2 also satisfies Π. Proof. Let r be a rule in Π. Assume r fires wrt S 0. Then r also fires wrt S 1 and S 2 (as Π is default-negation-free). So S 1 and S 2 satisfy head(r) = {l} (since Π is nondisjunctive). Thus l is in S 1, S 2, and S 0. Lemma (Proved by Dr. Michael Gelfond). Let Π be a nondisjunctive default-negation-free A-Prolog program. Assume Π has rules r 1 r 2 such that head(r 1 ) = head(r 2 ). Let Π 0 = Π \ {r 1, r 2 }, Π 1 = Π 0 {r 1 }, and Π 2 = Π 0 {r 2 }. If S is an answer set of Π, then S is also an answer set of either Π 1 or Π 2. Proof. To the contrary, assume S is an answer set of neither Π 1 nor Π 2. Still, S satisfies both Π 1 and Π 2 (as S satisfies Π). So there exist two proper subsets of S, say S 1 and S 2, which respectively satisfy Π 1 and Π 2 (the programs are default-negation-free). Page 8 of 16
9 1. Case 1 of 2: either r 1 fires wrt S 1, or r 2 fires wrt S 2. WOLOG, assume the former. Then S 1 satisfies head(r 1 ) = head(r 2 ). So S 1 also satisfies both the rule r 2 and the program Π = Π 1 {r 2 }. Recall that S is an answer set of Π whereas S 1 S, contradiction. 2. Case 2 of 2: neither r 1 fires wrt S 1, nor r 2 fires wrt S 2. So neither r 1 nor r 2 fires wrt S 0 = S 1 S 2 (the rules are default-negation-free). Then S 0 vacuously satisfies r 1 and r 2. Because S 1 and S 2 satisfy Π 0, by 4.2.6, S 0 satisfies Π 0 too. Therefore, S 0 satisfies Π = Π 0 {r 1, r 2 }. But S is an answer set of Π, and S 0 S, contradiction. Lemma Let Π be a nondisjunctive CR-Prolog program with some abductive support R. Then for all cr-rules r 1 and r 2 in R, we have head(r 1 ) = head(r 2 ) r 1 = r 2. Proof. By way of contradiction, assume there exist cr-rules r 1 r 2 in R where head(r 1 ) = head(r 2 ). Some notations: 1. Let R 1 = R \ {r 2 } and R 2 = R \ {r 1 }. 2. Let Π 1 = Π reg α(r 1 ) and Π 2 = Π reg α(r 2 ). 3. Let S be an answer set of Π wrt R. 4. Let Π a = Π 1 S and Π b = Π 2 S. Note that by 4.2.3, {α(r 1 )} S = {r 1 } and {α(r 2 )} S = {r 2 } for some default-negation-free rules r 1 and r 2. By 4.2.7, S is an answer set of either Π a or Π b. WOLOG, assume the former. Then S is an answer set of Π 1. So R 1 is an abductive support of Π, but R 1 < R, contradiction. Lemma Let Π be an acyclic CR-Prolog program having some answer set S wrt an abductive support R. Let cr-rule r R where head(r) = {l}. Then α(r) is the only rule in Π R = Π reg α(r) which supports l wrt S. Proof. By way of contradiction, assume l is also supported by a rule r α(r) in Π R. Let R = R \ {r} and Π = Π reg α(r ). We will prove S is an answer set of Π : 1. First, S satisfies Π Π R. 2. Let l be an arbitrary literal in S. We show l is supported wrt S by some rule in Π. Recall that S is an answer set of Π R. By 4.1.3, l is supported wrt S by some rule r 0 in Π R Case 1 of 2: r 0 = α(r). Recall head(r) = {l}. Then l = l. Notice r also supports l wrt S, and r Π. Page 9 of 16
10 2.2. Case 2 of 2: r 0 α(r). Then r 0 Π. So Π is consistent, and R is an abductive support of Π. But R < R, contradiction. Definition (Factified Rule). Let r be a regular rule. Let φ(r) denote the factified rule obtained from r by dropping its body. If R is a set of rules, then let φ(r) = {φ(r) : r R}. Lemma Let Π be a CR-Prolog program with answer set S and corresponding abductive support R. Then S is an answer set of Π = Π reg φ(α(r)). Proof. We prove S is a minimal context which satisfies Π S : 1. Let Π R = Π reg α(r). Note that head(r) S as S is an answer set of Π R. Then S satisfies Π S = (Π reg ) S φ(α(r)). 2. Assume some S S also satisfies Π S. We know head(r) S. Then S satisfies (Π R ) S = (Π reg ) S (α(r)) S. So S S (as S is an answer set of Π R ). Therefore S = S. Proposition Let Π be a CR-Prolog program. Then Π has antichain property if head(r 1 ) = head(r 2 ) for all abductive supports R 1 and R 2 of Π. Proof. Let S 1 and S 2 be arbitrary answer sets of Π corresponding to some abductive supports R 1 and R 2. By , S 1 and S 2 are respectively answer sets of Π reg φ(α(r 1 )) and Π reg φ(α(r 2 )), which are the same A-Prolog program because head(r 1 ) = head(r 2 ). By Theorem 3.1.4, S 1 S 2 S 1 = S CR-Independence and Acyclicity Definition (Proof of Literal). Let Π be an A-Prolog program, S be a context, and l be a literal. A proof of l wrt S in Π is a nonempty sequence of rules p = r 1,..., r n in Π such that: 1. for each rule r i, there is a (sole) literal l supported by r wrt S; let h S (r) denote l 2. l = h S (r n ) 3. body + (r 1 ) = 2 2 Their original definition states: r 1 is a fact. However, there is an error in their Lemma B.5 on page 83. Consider an acyclic A-Prolog program {a not b.} with answer set {a}. Page 10 of 16
11 4. for each rule r i, every literal in body + (r i ) is h S (r j ) for some j < i [Ben-Eliyahu and Dechter, 1994, page 57] Definition Additional notations: 1. P (l, S, Π) denotes the set of all proofs p of l wrt S in Π 2. h S (p) denotes {h S (r) : r p} 3. body + (p) denotes {body + (r) : r p} Remark Let p = r 1,..., r n P (l, S, Π). We adopt the convention that the rules in p are pairwise distinct. Indeed, if there were r i = r j where i < j, then p = r 1,..., r j 1, r j+1,..., r n P (l, S, Π), so r j would be redundant. Remark Let Π be a head-cycle-free A-Prolog program with answer set S. Then each literal in S has a proof wrt S in Π [Ben-Eliyahu and Dechter, 1994, page 57]. Definition (Rank of Literal). Let Π be a head-cycle-free A-Prolog program and S be a context. The rank of a literal l wrt S in Π, denoted by rank(l, S, Π), is min{ p : p P (l, S, Π)}. Definition (Ranking Function). Let: 1. Π be a head-cycle-free A-Prolog program 2. S be an answer set of Π 3. function f : S N Then f is the ranking function wrt S in Π if f(l) = rank(l, S, Π) for all l S. Definition (Normal Proof of Literal). Let: 1. Π be a head-cycle-free A-Prolog program 2. S be an answer set of Π 3. l S 4. p P (l, S, Π) 5. f be the ranking function wrt S in Π We say p is a normal proof if for all r p and l body + (r), we have f(l ) < f(h S (r)). Remark Let: Page 11 of 16
12 1. Π be a head-cycle-free A-Prolog program 2. S be an answer set of Π 3. f be the ranking function wrt S in Π 4. l S 5. normal p = r 1,..., r n P (l, S, Π) 6. r i p 7. l i body + (r i ). Then: 1. f(l i ) < f(l) 2. r 1,..., r i is a normal proof of h S (r i ) Example (Nonminimal Subproof of Minimal Proof). Consider this acylic A-Prolog program Π: a b, c. (1) b c1x. (2) c c1x. (3) c1x c1y. (4) c1y. (5) c c2. (6) c2. (7) The sole answer set of Π is S = {a, b, c, c1x, c1y, c2}. The only minimal proofs of literal a wrt S in Π are the two sequences of rules < 5, 4, 3, 2, 1 > and < 5, 4, 2, 3, 1 >. In both these proofs, the subproof of c is < 5, 4, 3 >, which is nonminimal. (The minimal proof of c wrt S in Π is < 7, 6 >.) Lemma Let: 1. Π 1 and Π 2 be head-cycle-free A-Prolog programs with corresponding answer sets S 1 S 2 2. l S 2 \ S 1 Then for each normal p = r 1,..., r n P (l, S 2, Π 2 ), there exists r p such that r Π 2 \ Π 1. Page 12 of 16
13 Proof. Let f be the ranking function wrt S 2 in Π 2. We employ induction on f(l). 1. Base step: f(l) = min{f(l ) : l S 2 \ S 1 } To the contrary, assume for every r p, we have r Π 1 Π Then r n Π As p is normal, for each l body + (r n ), we have f(l ) < f(l), so l S Then r n fires wrt S As S 1 is an answer set of Π 1, we know S 1 satisfies head(r n ) Let l head(r n ) Case 1 of 2: l = l. We already assumed l S 2 \ S Case 2 of 2: l l. We have l S 2, so l S So S 1 does not satisfy head(r n ), contradiction. 2. Induction step: f(l) max{f(l ) : l S 2 \ S 1 } Induction hypothesis: for each l S 2 \ S 1, let normal p P (l, S 2, Π 2 ), if f(l ) < f(l), then there exists r p such that r Π 2 \ Π To the contrary, assume for every r p, we have r Π 1 Π Case 1 of 2: there exists l body + (r n ) where l S 2 \ S Choose some 1 m n where h S2 (r m ) = l As p is normal, p = r 1,..., r m is a normal proof of l wrt S 2 in Π Notice f(l ) < f(l) By the induction hypothesis, p contains some r Π 2 \ Π So p also contains r By our assumption, r Π 1 Π 2, contradiction Case 2 of 2: for every l body + (r n ), we have l S Then r n fires wrt S By our assumption, r n Π As S 1 is an answer set of Π 1, we know S 1 satisfies head(r n ) But head(r n ) S 1 =, contradiction. Remark Let p = r 1,..., r n P (l, S, Π). If p is minimal, then: 1. p is normal 2. l depends on h S (r i ) for all i < n Page 13 of 16
14 Lemma Let Π be a nondisjunctive acyclic CR-Prolog program. If Π has answer sets S 1 S 2, then there exist literals l 1 and l 2 in head(π cr ) such that l 1 depends on l 2. Proof. Notations: 1. By the contrapositive of Proposition , there exist abductive supports R 1 and R 2 of Π where head(r 1 ) head(r 2 ). 2. Let R 1 = φ(α(r 1 )) and R 2 = φ(α(r 2 )). 3. Let Π 1 = Π reg R 1 and Π 2 = Π reg R 2. By Lemma , S 1 and S 2 are respectively answer sets of Π 1 and Π 2. We follow these steps: 1. By Lemma 4.2.8, since Π is nondisjunctive, we have R 1 = R 1 and R 2 = R Notice R 1 = R 2 > Then R 1 = R 2 > Observe head(r 1 ) = R 1 and head(r 2 ) = R Thus head(r 1 ) = head(r 2 ) > Recall head(r 1 ) = head(r 1 ) head(r 2 ) = head(r 2 ). 7. Then head(r 1 ) \ head(r 2 ). 8. Select some l 1 head(r 1 ) \ head(r 2 ). 9. Let r 1 be the fact (l 1.) in R 1 \ R Since S 1 is an answer set of Π 1, we have l 1 S Recall S 1 S 2. Then l 1 S As S 2 is an answer set of Π 2, there exists r Π 2 which supports l 1 wrt S Case 1 of 2: there exists l body + (r) where l S 2 \ S Let minimal p P (l, S 2, Π 2 ) By Lemma , there exists r 2 p where r 2 Π 2 \ Π Then r 2 R 2 \ R 1 α(π cr ) Let h S2 (r 2 ) = l 2 head(π cr ) As p is minimal, l depends on l Recall l 1 depends on l in r. Page 14 of 16
15 By transitivity, l 1 depends on l Case 2 of 2: body + (r) S 1. We show this case is impossible Subcase 1 of 2: r Π 1 Π Notice r supports l 1 wrt S By Lemma 4.2.9, since Π is acyclic, we have r = r However, r Π 2 whereas r 1 Π 1 \ Π 2, contradiction Subcase 2 of 2: r Π 2 \ Π So r R 2 \ R Then r is the fact (l 1.), which is exactly r However, we selected r 1 from R 1 \ R 2 while r R 2, contradiction. Remark If a CR-Prolog program Π is acyclic, then there exists a nondisjunctive acyclic CR-Prolog program Π equivalent to Π [Ben-Eliyahu and Dechter, 1994, page 73, Theorem 4.17]. Theorem (Antichain Property of CR-Independent Acyclic CR-Prolog Programs). Let Π be an acyclic CR-Prolog program. If Π is cr-independent, then Π has antichain property. Proof. By Remark , there exists a nondisjunctive acyclic CR-Prolog Π equivalent to Π. By the contrapositive of Lemma , Π has antichain property. Therefore, Π has antichain property too. 5 Conclusion We have found a reasonably weak syntactic condition which guarantees that a CR-Prolog program has antichain property: the program being acyclic and cr-independent. The future goal is to further relax this sufficient condition to extend the class of CR-Prolog programs known to have this desired semantic property. 6 Acknowledgment We sincerely appreciate the significant guidance of Dr. Michael Gelfond. This paper includes his proofs of Theorem and Lemma We also thank Evgenii Balai for the informative discussions. Page 15 of 16
16 References Marcello Balduccini and Michael Gelfond. Logic programs with consistency-restoring rules. In International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, volume 102, Rachel Ben-Eliyahu and Rina Dechter. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial intelligence, 12(1):53 87, Esra Erdem, Michael Gelfond, and Nicola Leone. Applications of answer set programming. AI Magazine, 37(3):53 68, Michael Gelfond and Yulia Kahl. Knowledge representation, reasoning, and the design of intelligent agents: The answer-set programming approach. Cambridge University Press, Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In ICLP/SLP, volume 88, pages , Page 16 of 16
Loop Formulas for Disjunctive Logic Programs
Nineteenth International Conference on Logic Programming (ICLP-03), pages 451-465, Mumbai, India, 2003 Loop Formulas for Disjunctive Logic Programs Joohyung Lee and Vladimir Lifschitz Department of Computer
More informationTwo-Valued Logic Programs
Two-Valued Logic Programs Vladimir Lifschitz University of Texas at Austin, USA Abstract We define a nonmonotonic formalism that shares some features with three other systems of nonmonotonic reasoning
More informationNested Epistemic Logic Programs
Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and
More informationElementary Sets for Logic Programs
Elementary Sets for Logic Programs Martin Gebser Institut für Informatik Universität Potsdam, Germany Joohyung Lee Computer Science and Engineering Arizona State University, USA Yuliya Lierler Department
More informationA Theory of Forgetting in Logic Programming
A Theory of Forgetting in Logic Programming Kewen Wang 1,2 and Abdul Sattar 1,2 and Kaile Su 1 1 Institute for Integrated Intelligent Systems 2 School of Information and Computation Technology Griffith
More informationDisjunctive Signed Logic Programs
Disjunctive Signed Logic Programs Mohamed A. Khamsi 1 and Driss Misane 2 1 Department of Mathematical Sciences University of Texas at El Paso, El Paso, TX 79968. 2 Département de Mathématiques, Faculté
More informationOn Elementary Loops of Logic Programs
Under consideration for publication in Theory and Practice of Logic Programming 1 On Elementary Loops of Logic Programs Martin Gebser Institut für Informatik Universität Potsdam, Germany (e-mail: gebser@cs.uni-potsdam.de)
More informationGuarded resolution for Answer Set Programming
Under consideration for publication in Theory and Practice of Logic Programming 1 Guarded resolution for Answer Set Programming V.W. Marek Department of Computer Science, University of Kentucky, Lexington,
More informationElementary Sets for Logic Programs
Elementary Sets for Logic Programs Martin Gebser Institut für Informatik Universität Potsdam, Germany Joohyung Lee Computer Science and Engineering Arizona State University, USA Yuliya Lierler Department
More informationSplitting a Default Theory. Hudson Turner. University of Texas at Austin.
Splitting a Default Theory Hudson Turner Department of Computer Sciences University of Texas at Austin Austin, TX 7872-88, USA hudson@cs.utexas.edu Abstract This paper presents mathematical results that
More informationReducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs Miroslaw Truszczyński Department of Computer Science, University of Kentucky, Lexington,
More informationFuzzy Answer Set semantics for Residuated Logic programs
semantics for Logic Nicolás Madrid & Universidad de Málaga September 23, 2009 Aims of this paper We are studying the introduction of two kinds of negations into residuated : Default negation: This negation
More informationEpistemic Reasoning in Logic Programs
Abstract Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents epistemic behaviours, it embeds a significantly higher computational
More informationOn the Relationship between P-log and LP MLN
On the Relationship between P-log and LP MLN Evgenii Balai and Michael Gelfond Texas Tech University, Lubbock Texas {evgenii.balai, michael.gelfond}@ttu.edu Abstract. The paper investigates the relationship
More informationCharacterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action Languages B, C and Beyond
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Characterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action
More informationOn the Stable Model Semantics for Intensional Functions
Under consideration for publication in Theory and Practice of Logic Programming 1 On the Stable Model Semantics for Intensional Functions Michael Bartholomew and Joohyung Lee School of Computing, Informatics,
More informationCombining Answer Sets of Nonmonotonic Logic Programs
Combining Answer Sets of Nonmonotonic Logic Programs Chiaki Sakama 1 and Katsumi Inoue 2 1 Department of Computer and Communication Sciences Wakayama University, Sakaedani, Wakayama 640-8510, Japan sakama@sys.wakayama-u.ac.jp
More informationTrichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs Mirosław Truszczyński Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA Abstract. We present
More informationSemantic forgetting in answer set programming. Author. Published. Journal Title DOI. Copyright Statement. Downloaded from. Griffith Research Online
Semantic forgetting in answer set programming Author Eiter, Thomas, Wang, Kewen Published 2008 Journal Title Artificial Intelligence DOI https://doi.org/10.1016/j.artint.2008.05.002 Copyright Statement
More informationINVESTIGATING AND EXTENDING P-LOG. by Evgenii Balai, Dipl.-Ing. A Dissertation in COMPUTER SCIENCE
INVESTIGATING AND EXTENDING P-LOG by Evgenii Balai, Dipl.-Ing A Dissertation in COMPUTER SCIENCE Submitted to the Graduate Faculty of Texas Tech University in Partial Fulfillment of the Requirements for
More informationLoop Formulas for Circumscription
Loop Formulas for Circumscription Joohyung Lee Department of Computer Sciences University of Texas, Austin, TX, USA appsmurf@cs.utexas.edu Fangzhen Lin Department of Computer Science Hong Kong University
More informationA Unified Framework for Representing Logic Program Updates
A Unified Framework for Representing Logic Program Updates Yan Zhang School of Computing & Information Technology University of Western Sydney NSW 1797 Australia E-mail: yan@cit.uws.edu.au Norman Foo School
More informationThe AAA Architecture: An Overview
The AAA Architecture: An Overview Marcello Balduccini and Michael Gelfond Computer Science Department Texas Tech University Lubbock, TX 79409 USA marcello.balduccini@gmail.com, michael.gelfond@ttu.edu
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationNotions of Strong Equivalence for Logic Programs with Ordered Disjunction
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction Wolfgang Faber Department of Mathematics University of Calabria Via P. Bucci, cubo 30b 87036 Rende (CS), Italy wf@wfaber.com Hans
More informationLloyd-Topor Completion and General Stable Models
Lloyd-Topor Completion and General Stable Models Vladimir Lifschitz and Fangkai Yang Department of Computer Science The University of Texas at Austin {vl,fkyang}@cs.utexas.edu Abstract. We investigate
More informationResolving Conflicts in Action Descriptions
Resolving Conflicts in Action Descriptions Thomas Eiter and Esra Erdem and Michael Fink and Ján Senko 1 Abstract. We study resolving conflicts between an action description and a set of conditions (possibly
More informationThe natural numbers. Definition. Let X be any inductive set. We define the set of natural numbers as N = C(X).
The natural numbers As mentioned earlier in the course, the natural numbers can be constructed using the axioms of set theory. In this note we want to discuss the necessary details of this construction.
More informationOn Elementary Loops and Proper Loops for Disjunctive Logic Programs
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence On Elementary Loops and Proper Loops for Disjunctive Logic Programs Jianmin Ji School of Computer Science and Technology University
More informationDeclarative Semantics for Active Integrity Constraints
Declarative Semantics for Active Integrity Constraints Luciano Caroprese 1 and Mirosław Truszczyński 2 1 Università della Calabria, 87030 Rende, Italy 2 Department of Computer Science, University of Kentucky,
More informationStable Models and Difference Logic
Stable Models and Difference Logic Ilkka Niemelä Helsinki University of Technology Laboratory for Theoretical Computer Science P.O.Box 5400, FI-02015 TKK, Finland Ilkka.Niemela@tkk.fi Dedicated to Victor
More informationrules strictly includes the class of extended disjunctive programs. Interestingly, once not appears positively as above, the principle of minimality d
On Positive Occurrences of Negation as Failure 3 Katsumi Inoue Department of Information and Computer Sciences Toyohashi University of Technology Tempaku-cho, Toyohashi 441, Japan inoue@tutics.tut.ac.jp
More informationArgumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred
Argumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred Sanjay Modgil November 17, 2017 Abstract A number of argumentation formalisms provide dialectical
More informationCombining Logical and Probabilistic Reasoning
Combining Logical and Probabilistic Reasoning Michael Gelfond and Nelson Rushton and Weijun Zhu Computer Science Department Texas Tech University Lubbock, TX 79409 USA {mgelfond,nrushton,weijun.zhu}@cs.ttu.edu
More informationArtificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
More informationActive Integrity Constraints and Revision Programming
Under consideration for publication in Theory and Practice of Logic Programming 1 Active Integrity Constraints and Revision Programming Luciano Caroprese 1 and Miros law Truszczyński 2 1 Università della
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationComparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs
Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs KEWEN WANG Griffith University and LIZHU ZHOU Tsinghua University Much work has been done on extending the well-founded
More informationResolving Conflicts in Action Descriptions
Resolving Conflicts in Action Descriptions Thomas Eiter and Esra Erdem and Michael Fink and Ján Senko Institut für Informationssysteme 184/3, Technische Universität Wien Favoritenstraße 9-11, 1040 Wien,
More informationLogic Programs with Abstract Constraint Atoms: The Role of Computations
Logic Programs with Abstract Constraint Atoms: The Role of Computations Lengning Liu a Enrico Pontelli,b Tran Cao Son b Miroslaw Truszczyński a a Department of Computer Science, University of Kentucky,
More informationOn the Relationship of Defeasible Argumentation and Answer Set Programming
On the Relationship of Defeasible Argumentation and Answer Set Programming Matthias Thimm a Gabriele Kern-Isberner a a Information Engineering Group, Department of Computer Science University of Dortmund,
More informationarxiv: v1 [cs.lo] 8 Jan 2013
Lloyd-Topor Completion and General Stable Models Vladimir Lifschitz and Fangkai Yang Department of Computer Science The University of Texas at Austin {vl,fkyang}@cs.utexas.edu arxiv:1301.1394v1 [cs.lo]
More informationTechnical R e p o r t. Merging in the Horn Fragment DBAI-TR Adrian Haret, Stefan Rümmele, Stefan Woltran. Artificial Intelligence
Technical R e p o r t Institut für Informationssysteme Abteilung Datenbanken und Artificial Intelligence Merging in the Horn Fragment DBAI-TR-2015-91 Adrian Haret, Stefan Rümmele, Stefan Woltran Institut
More informationCR-Prolog: Logic Programs with CR-Rules. Consistency-Restoring Rules
CR-Prolog: Logic Programs with Consistency-Restoring Rules Marcello Balduccini and Michael Gelfond August, 21 2003 Knowledge Representation Lab Texas Tech University Talk Outline Agent architecture Typical
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationAction Language BC: Preliminary Report
Action Language BC: Preliminary Report Joohyung Lee 1, Vladimir Lifschitz 2 and Fangkai Yang 2 1 School of Computing, Informatics and Decision Systems Engineering, Arizona State University joolee@asu.edu
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationSemantic Forcing in Disjunctive Logic Programs
Semantic Forcing in Disjunctive Logic Programs Marina De Vos and Dirk Vermeir Dept. of Computer Science Free University of Brussels, VUB Pleinlaan 2, Brussels 1050, Belgium Abstract We propose a semantics
More informationExtending Logic Programs with Description Logic Expressions for the Semantic Web
Extending Logic Programs with Description Logic Expressions for the Semantic Web Yi-Dong Shen 1 and Kewen Wang 2 1 State Key Laboratory of Computer Science, Institute of Software Chinese Academy of Sciences,
More informationPropositional Calculus - Soundness & Completeness of H
Propositional Calculus - Soundness & Completeness of H Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Review Goal of logic To check whether given a formula Á is valid To prove a given formula Á `
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationA theory of modular and dynamic knowledge representation
A theory of modular and dynamic knowledge representation Ján Šefránek Institute of Informatics, Comenius University, Mlynská dolina, 842 15 Bratislava, Slovakia, phone: (421-7) 6029 5436, e-mail: sefranek@fmph.uniba.sk
More informationPropositional Resolution Part 1. Short Review Professor Anita Wasilewska CSE 352 Artificial Intelligence
Propositional Resolution Part 1 Short Review Professor Anita Wasilewska CSE 352 Artificial Intelligence SYNTAX dictionary Literal any propositional VARIABLE a or negation of a variable a, a VAR, Example
More informationPearl s Causality In a Logical Setting
Pearl s Causality In a Logical Setting Alexander Bochman Computer Science Department Holon Institute of Technology, Israel bochmana@hit.ac.il Vladimir Lifschitz Department of Computer Science University
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationForgetting and Conflict Resolving in Disjunctive Logic Programming
Forgetting and Conflict Resolving in Disjunctive Logic Programming Author Eiter, Thomas, Wang, Kewen Published 2006 Conference Title Proceedings, Twenty-First National Conference on Artificial Intelligence
More informationConflict-Based Belief Revision Operators in Possibilistic Logic
Conflict-Based Belief Revision Operators in Possibilistic Logic Author Qi, Guilin, Wang, Kewen Published 2012 Conference Title Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence
More informationTE C H N I C A L R E P O R T. Model-Based Recasting in Answer-Set Programming INSTITUT FÜR INFORMATIONSSYSTEME DBAI-TR
TE C H N I C A L R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ABTEILUNG DATENBANKEN UND ARTIFICIAL INTELLIGENCE Model-Based Recasting in Answer-Set Programming DBAI-TR-2013-83 Thomas Eiter Michael Fink
More informationINTRODUCTION TO NONMONOTONIC REASONING
Faculty of Computer Science Chair of Automata Theory INTRODUCTION TO NONMONOTONIC REASONING Anni-Yasmin Turhan Dresden, WS 2017/18 About the Course Course Material Book "Nonmonotonic Reasoning" by Grigoris
More informationElementary Loops Revisited
Elementary Loops Revisited Jianmin Ji a, Hai Wan b, Peng Xiao b, Ziwei Huo b, and Zhanhao Xiao c a School of Computer Science and Technology, University of Science and Technology of China, Hefei, China
More informationA Schema for Generating Update Semantics
A Schema for Generating Update Semantics José Luis Carballido Carranza Benemérita Universidad Autónoma de Puebla jlcarballido7@gmail.com Abstract In this paper, we present a general schema for defining
More informationIntegrating Answer Set Programming and Satisfiability Modulo Theories
Integrating Answer Set Programming and Satisfiability Modulo Theories Ilkka Niemelä Helsinki University of Technology (TKK) Department of Information and Computer Science http://www.tcs.tkk.fi/ ini/ References:
More informationSimplified Reduct for Choice Rules in ASP
Simplified Reduct for Choice Rules in ASP Mark Law, Alessandra Russo and Krysia Broda April 25, 2015 Abstract The accepted definitions of the semantics of choice rules in Answer Set Programming (ASP) involve
More informationYet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs Joohyung Lee and Ravi Palla School of Computing and Informatics Arizona State University, Tempe, AZ, USA {joolee,
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationA transition system for AC language algorithms
University of Nebraska at Omaha DigitalCommons@UNO Computer Science Faculty Proceedings & Presentations Department of Computer Science 2011 A transition system for AC language algorithms Yuliya Lierler
More informationPropositional and Predicate Logic - II
Propositional and Predicate Logic - II Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - II WS 2016/2017 1 / 16 Basic syntax Language Propositional logic
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
More information3 Propositional Logic
3 Propositional Logic 3.1 Syntax 3.2 Semantics 3.3 Equivalence and Normal Forms 3.4 Proof Procedures 3.5 Properties Propositional Logic (25th October 2007) 1 3.1 Syntax Definition 3.0 An alphabet Σ consists
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationComparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs
Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs arxiv:cs/0301010v2 [cs.ai] 16 Jan 2003 Kewen Wang School of Computing and Information Technology Griffith University,
More informationNon-monotonic Logic I
Non-monotonic Logic I Bridges between classical and non-monotonic consequences Michal Peliš 1 Common reasoning monotonicity Γ ϕ Γ ϕ can fail caused by: background knowledge, implicit facts, presuppositions,
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationPreference, Choice and Utility
Preference, Choice and Utility Eric Pacuit January 2, 205 Relations Suppose that X is a non-empty set. The set X X is the cross-product of X with itself. That is, it is the set of all pairs of elements
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationArtificial Intelligence
Artificial Intelligence Propositional Logic [1] Boolean algebras by examples U X U U = {a} U = {a, b} U = {a, b, c} {a} {b} {a, b} {a, c} {b, c}... {a} {b} {c} {a, b} {a} The arrows represents proper inclusion
More informationPropositional Resolution Introduction
Propositional Resolution Introduction (Nilsson Book Handout) Professor Anita Wasilewska CSE 352 Artificial Intelligence Propositional Resolution Part 1 SYNTAX dictionary Literal any propositional VARIABLE
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More information(A 3 ) (A 1 ) (1) COMPUTING CIRCUMSCRIPTION. Vladimir Lifschitz. Department of Computer Science Stanford University Stanford, CA
COMPUTING CIRCUMSCRIPTION Vladimir Lifschitz Department of Computer Science Stanford University Stanford, CA 94305 Abstract Circumscription is a transformation of predicate formulas proposed by John McCarthy
More informationInfinitary Equilibrium Logic and Strong Equivalence
Infinitary Equilibrium Logic and Strong Equivalence Amelia Harrison 1 Vladimir Lifschitz 1 David Pearce 2 Agustín Valverde 3 1 University of Texas, Austin, Texas, USA 2 Universidad Politécnica de Madrid,
More information2 Transition Systems Denition 1 An action signature consists of three nonempty sets: a set V of value names, a set F of uent names, and a set A of act
Action Languages Michael Gelfond Department of Computer Science University of Texas at El Paso Austin, TX 78768, USA Vladimir Lifschitz Department of Computer Sciences University of Texas at Austin Austin,
More informationUniform Equivalence of Logic Programs under the Stable Model Semantics
In: Proc. 19th International Conference on Logic Programming (ICLP 2003), LNCS, c 2003 Springer. Uniform Equivalence of Logic Programs under the Stable Model Semantics Thomas Eiter and Michael Fink Institut
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationLogic programs with monotone abstract constraint atoms
Under consideration for publication in Theory and Practice of Logic Programming 1 Logic programs with monotone abstract constraint atoms Victor W. Marek Department of Computer Science, University of Kentucky,
More informationComputing Loops With at Most One External Support Rule
Computing Loops With at Most One External Support Rule Xiaoping Chen and Jianmin Ji University of Science and Technology of China P. R. China xpchen@ustc.edu.cn, jizheng@mail.ustc.edu.cn Fangzhen Lin Department
More information: 9 ; < = = 4 < < 7 7
! " # $! % & " &! & ' ( # )! * & +! ' $, -! % +, & % & ( ( ) ( (!, # ) $!!. %!!, + ) # % $!! / %!! # ) 0 0 % # -! " ' $ &! (! ( ) #, " 1 2 3 4 5 6 7 5 8 9 : 9 ; < 2 7 1 9 = = 4 < < 7 7 $ & & % & ( & $!
More information[3] R.M. Colomb and C.Y.C. Chung. Very fast decision table execution of propositional
- 14 - [3] R.M. Colomb and C.Y.C. Chung. Very fast decision table execution of propositional expert systems. Proceedings of the 8th National Conference on Articial Intelligence (AAAI-9), 199, 671{676.
More informationSyntactic Characterisations in Model Theory
Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More informationEquivalence for the G 3-stable models semantics
Equivalence for the G -stable models semantics José Luis Carballido 1, Mauricio Osorio 2, and José Ramón Arrazola 1 1 Benemérita Universidad Autóma de Puebla, Mathematics Department, Puebla, México carballido,
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More information