BirdClassificationProlog.cpp

#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

map<string, set<string>> attributes;

void initialize() {
    attributes["sparrow"] = {"feathers", "flies", "small", "land"};
    attributes["penguin"] = {"feathers", "swims", "cannot fly", "water"};
    attributes["ostrich"] = {"feathers", "cannot fly", "land"};
}

string classify(const set<string>& attrs) {
    for (const auto& entry : attributes) {
        if (includes(attrs.begin(), attrs.end(),
                     entry.second.begin(), entry.second.end())) {
            return entry.first;
        }
    }
    return "unknown bird";
}

int main() {
    initialize();
    set<string> query1 = {"feathers", "flies", "small", "land"};
    set<string> query2 = {"feathers", "swims", "cannot fly", "water"};

    cout << "Bird 1 classification: " << classify(query1) << '\n';
    cout << "Bird 2 classification: " << classify(query2) << '\n';
    return 0;
}