Package aima.core.logic.fol.inference.proof

Examples of aima.core.logic.fol.inference.proof.ProofFinal

218
219
220
221
222
223
224
225
    public void setAllProofSteps(List<List<ProofStepBwChGoal>> allProofSteps) {
      for (List<ProofStepBwChGoal> steps : allProofSteps) {
        ProofStepBwChGoal lastStep = steps.get(steps.size() - 1);
        Map<Variable, Term> theta = lastStep.getBindings();
        proofs.add(new ProofFinal(lastStep, theta));
      }
    }
View Full Code Here
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
    public boolean isAnswer(Clause clause) {
      boolean isAns = false;

      if (answerClause.isEmpty()) {
        if (clause.isEmpty()) {
          proofs.add(new ProofFinal(clause.getProofStep(),
              new HashMap<Variable, Term>()));
          complete = true;
          isAns = true;
        }
      } else {
        if (clause.isEmpty()) {
          // This should not happen
          // as added an answer literal to sos, which
          // implies the database (i.e. premises) are
          // unsatisfiable to begin with.
          throw new IllegalStateException(
              "Generated an empty clause while looking for an answer, implies original KB or usable is unsatisfiable");
        }

        if (clause.isUnitClause()
            && clause.isDefiniteClause()
            && clause
                .getPositiveLiterals()
                .get(0)
                .getAtomicSentence()
                .getSymbolicName()
                .equals(answerLiteral.getAtomicSentence()
                    .getSymbolicName())) {
          Map<Variable, Term> answerBindings = new HashMap<Variable, Term>();
          List<Term> answerTerms = clause.getPositiveLiterals()
              .get(0).getAtomicSentence().getArgs();
          int idx = 0;
          for (Variable v : answerLiteralVariables) {
            answerBindings.put(v, answerTerms.get(idx));
            idx++;
          }
          boolean addNewAnswer = true;
          for (Proof p : proofs) {
            if (p.getAnswerBindings().equals(answerBindings)) {
              addNewAnswer = false;
              break;
            }
          }
          if (addNewAnswer) {
            proofs.add(new ProofFinal(clause.getProofStep(),
                answerBindings));
          }
          isAns = true;
        }
      }
View Full Code Here
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
    public boolean isAnswer(Chain nearParent) {
      boolean isAns = false;
      if (answerChain.isEmpty()) {
        if (nearParent.isEmpty()) {
          proofs.add(new ProofFinal(nearParent.getProofStep(),
              new HashMap<Variable, Term>()));
          complete = true;
          isAns = true;
        }
      } else {
        if (nearParent.isEmpty()) {
          // This should not happen
          // as added an answer literal to sos, which
          // implies the database (i.e. premises) are
          // unsatisfiable to begin with.
          throw new IllegalStateException(
              "Generated an empty chain while looking for an answer, implies original KB is unsatisfiable");
        }
        if (1 == nearParent.getNumberLiterals()
            && nearParent
                .getHead()
                .getAtomicSentence()
                .getSymbolicName()
                .equals(answerChain.getHead()
                    .getAtomicSentence().getSymbolicName())) {
          Map<Variable, Term> answerBindings = new HashMap<Variable, Term>();
          List<Term> answerTerms = nearParent.getHead()
              .getAtomicSentence().getArgs();
          int idx = 0;
          for (Variable v : answerLiteralVariables) {
            answerBindings.put(v, answerTerms.get(idx));
            idx++;
          }
          boolean addNewAnswer = true;
          for (Proof p : proofs) {
            if (p.getAnswerBindings().equals(answerBindings)) {
              addNewAnswer = false;
              break;
            }
          }
          if (addNewAnswer) {
            proofs.add(new ProofFinal(nearParent.getProofStep(),
                answerBindings));
          }
          isAns = true;
        }
      }
View Full Code Here
216
217
218
219
220
221
222
223
      stepFinal = step;
    }

    public void setAnswers(Set<Map<Variable, Term>> answers) {
      for (Map<Variable, Term> ans : answers) {
        proofs.add(new ProofFinal(stepFinal, ans));
      }
    }
View Full Code Here
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
      // If no bindings being looked for, then
      // is just a true false query.
      for (Clause aClause : resolvents) {
        if (answerClause.isEmpty()) {
          if (aClause.isEmpty()) {
            proofs.add(new ProofFinal(aClause.getProofStep(),
                new HashMap<Variable, Term>()));
            complete = true;
          }
        } else {
          if (aClause.isEmpty()) {
            // This should not happen
            // as added an answer literal, which
            // implies the database (i.e. premises) are
            // unsatisfiable to begin with.
            throw new IllegalStateException(
                "Generated an empty clause while looking for an answer, implies original KB is unsatisfiable");
          }

          if (aClause.isUnitClause()
              && aClause.isDefiniteClause()
              && aClause
                  .getPositiveLiterals()
                  .get(0)
                  .getAtomicSentence()
                  .getSymbolicName()
                  .equals(answerLiteral.getAtomicSentence()
                      .getSymbolicName())) {
            Map<Variable, Term> answerBindings = new HashMap<Variable, Term>();
            List<Term> answerTerms = aClause.getPositiveLiterals()
                .get(0).getAtomicSentence().getArgs();
            int idx = 0;
            for (Variable v : answerLiteralVariables) {
              answerBindings.put(v, answerTerms.get(idx));
              idx++;
            }
            boolean addNewAnswer = true;
            for (Proof p : proofs) {
              if (p.getAnswerBindings().equals(answerBindings)) {
                addNewAnswer = false;
                break;
              }
            }
            if (addNewAnswer) {
              proofs.add(new ProofFinal(aClause.getProofStep(),
                  answerBindings));
            }
          }
        }
View Full Code Here
208
209
210
211
212
213
214
215
    public void setAllProofSteps(List<List<ProofStepBwChGoal>> allProofSteps) {
      for (List<ProofStepBwChGoal> steps : allProofSteps) {
        ProofStepBwChGoal lastStep = steps.get(steps.size() - 1);
        Map<Variable, Term> theta = lastStep.getBindings();
        proofs.add(new ProofFinal(lastStep, theta));
      }
    }
View Full Code Here
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
    public boolean isAnswer(Clause aClause) {
      boolean isAns = false;

      if (answerClause.isEmpty()) {
        if (aClause.isEmpty()) {
          proofs.add(new ProofFinal(aClause.getProofStep(),
              new HashMap<Variable, Term>()));
          complete = true;
          isAns = true;
        }
      } else {
        if (aClause.isEmpty()) {
          // This should not happen
          // as added an answer literal to sos, which
          // implies the database (i.e. premises) are
          // unsatisfiable to begin with.
          throw new IllegalStateException(
              "Generated an empty clause while looking for an answer, implies original KB or usable is unsatisfiable");
        }

        if (aClause.isUnitClause()
            && aClause.isDefiniteClause()
            && aClause
                .getPositiveLiterals()
                .get(0)
                .getAtomicSentence()
                .getSymbolicName()
                .equals(answerLiteral.getAtomicSentence()
                    .getSymbolicName())) {
          Map<Variable, Term> answerBindings = new HashMap<Variable, Term>();
          List<Term> answerTerms = aClause.getPositiveLiterals()
              .get(0).getAtomicSentence().getArgs();
          int idx = 0;
          for (Variable v : answerLiteralVariables) {
            answerBindings.put(v, answerTerms.get(idx));
            idx++;
          }
          boolean addNewAnswer = true;
          for (Proof p : proofs) {
            if (p.getAnswerBindings().equals(answerBindings)) {
              addNewAnswer = false;
              break;
            }
          }
          if (addNewAnswer) {
            proofs.add(new ProofFinal(aClause.getProofStep(),
                answerBindings));
          }
          isAns = true;
        }
      }
View Full Code Here
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
    public boolean isAnswer(Chain nearParent) {
      boolean isAns = false;
      if (answerChain.isEmpty()) {
        if (nearParent.isEmpty()) {
          proofs.add(new ProofFinal(nearParent.getProofStep(),
              new HashMap<Variable, Term>()));
          complete = true;
          isAns = true;
        }
      } else {
        if (nearParent.isEmpty()) {
          // This should not happen
          // as added an answer literal to sos, which
          // implies the database (i.e. premises) are
          // unsatisfiable to begin with.
          throw new IllegalStateException(
              "Generated an empty chain while looking for an answer, implies original KB is unsatisfiable");
        }
        if (1 == nearParent.getNumberLiterals()
            && nearParent
                .getHead()
                .getAtomicSentence()
                .getSymbolicName()
                .equals(answerChain.getHead()
                    .getAtomicSentence().getSymbolicName())) {
          Map<Variable, Term> answerBindings = new HashMap<Variable, Term>();
          List<Term> answerTerms = nearParent.getHead()
              .getAtomicSentence().getArgs();
          int idx = 0;
          for (Variable v : answerLiteralVariables) {
            answerBindings.put(v, answerTerms.get(idx));
            idx++;
          }
          boolean addNewAnswer = true;
          for (Proof p : proofs) {
            if (p.getAnswerBindings().equals(answerBindings)) {
              addNewAnswer = false;
              break;
            }
          }
          if (addNewAnswer) {
            proofs.add(new ProofFinal(nearParent.getProofStep(),
                answerBindings));
          }
          isAns = true;
        }
      }
View Full Code Here
213
214
215
216
217
218
219
220
      stepFinal = step;
    }

    public void setAnswers(Set<Map<Variable, Term>> answers) {
      for (Map<Variable, Term> ans : answers) {
        proofs.add(new ProofFinal(stepFinal, ans));
      }
    }
View Full Code Here
TOP

Related Classes of aima.core.logic.fol.inference.proof.ProofFinal

  • aima.core.logic.fol.inference.FOLBCAsk$BCAskAnswerHandler
  • aima.core.logic.fol.inference.FOLFCAsk$FCAskAnswerHandler
  • aima.core.logic.fol.inference.FOLModelElimination$AnswerHandler
  • aima.core.logic.fol.inference.FOLOTTERLikeTheoremProver$OTTERAnswerHandler
  • aima.core.logic.fol.inference.FOLTFMResolution$TFMAnswerHandler
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.