Prolog代写代考

% Prolog code to demonstrate default reasoning. % Copyright (c) David Poole and Alan Mackworth 2017. This program % is released under GPL, version 3 or later; see http://www.gnu.org/licenses/gpl.html :- dynamic on_beach/0, ab_beach_access/0, beach_access/0, ab_swim_at_beach/0, enclosed_bay/0, big_city/0, ab_no_swimming_near_city/0, in_BC/0, ab_BC_beaches/0. away_from_beach :- \+ on_beach. beach_access :- on_beach, \+ ab_beach_access. swim_at_beach :- beach_access, \+ ab_swim_at_beach. ab_swim_at_beach […]

A progression of logical languages Propositional logic programs: atoms have no arguments. Datalog: allow for logical variables in clauses and queries. Prolog: Datalog + function symbols CPSC 312 — Lecture 18 1 / 11 ©D. Poole 2021 A progression of logical languages Propositional logic programs: atoms have no arguments. Datalog: allow for logical variables in

% CPSC 312 – simple “is” definition in Prolog % Copyright D Poole 2021, Released under CC BY-NC-SA 4.0 https://creativecommons.org/licenses/by-nc-sa/4.0/ % myis(N,E) is true if expression E evaluates to number N myis(N,N) :- number(N). myis(N,A+B) :- myis(NA,A), myis(NB,B), N is NA+NB. myis(N,A*B) :- myis(NA,A), myis(NB,B), N is NA*NB. myis(0,zero). myis(1,one). myis(2,two). myis(3,three). %?- myis(X, 3*(two+7)+10).

% CPSC 312 — Prolog Code from the 2016 Final % Copyright 2017 – not for redistribution % Question 1 foo([],Y,Y). foo([A|B],C,[A|D]) :- foo(C,B,D). % foo([1,3], [9,7,4], A). % Powerset % Straight Recusion powerset([],[[]]). powerset([H|T], R) :- powerset(T,PT), applytoeach(H,PT,R). applytoeach(_,[],[]). applytoeach(H,[E|R],[[H|E],E|PR]) :- applytoeach(H,R,PR). % With an accumulator powset([],[[]]). powset([H|T],R) :- powset(T,TP), add_to_each(H,TP,TP,R). add_to_each(_,[],TP,TP). add_to_each(H,[L|R],TP,[[H|L]|A]) :-