Per anno

@article{constraintnetworks-is7,
    abstract = {The problem of representation and handling of constraints is here considered, mainly for picture processing purposes. A systematic specification and utilization of the available constraints could significantly reduce the amount of search in picture recognition. On the other hand, formally stated constraints can be embedded in the syntactic productions of picture languages. Only binary constraints are treated here, but they are represented in full generality as binary relations. Constraints among more than two variables are then represented as networks of simultaneous binary relations. In general, more than one equivalent (i.e., representing the same constraint) network can be found: a minimal equivalent network is shown to exist, and its computation is shown to solve most practical problems about constraint handling. No exact solution for this central problem was found. Anyway, constraints are treated algebraically, and the solution of a system of linear equations in this algebra provides an approximation of the minimal network. This solution is then proved exact in special cases, e.g., for tree-like and series-parallel networks and for classes of relations for which a distributive property holds. This latter condition is satisfied in cases of practical interest.},
    apice = {ConstraintnetworksIs7},
    author = {Ugo Montanari},
    doi = {10.1016/0020-0255(74)90008-5},
    journal = {Information Sciences},
    numpages = 38,
    pages = {95--132},
    publisher = {Elsevier},
    title = {Networks of Constraints: Fundamental Properties and Applications to Picture Processing},
    volume = 7,
    year = 1974
}

@inproceedings{pl-ifip74,
    abstract = {The interpretation of predicate logic as a programming language is based upon the interpretation of implications B if A1 and ... and An as procedure declarations, where B is the procedure name and A1, \ldots, An is the set of procedure calls Ai constituting the procedure body. An axiomatisation of a problem domain is a program for solving problems in that domain. Individual problems are posed as theorems to be proved. Proofs are computations generated by the theorem-prover which executes the program incorporated in the axioms. Our thesis is that predicate logic is a useful and practical, high-level, non-deterministic programming language with sound theoretical foundations.},
    address = {Amsterdam, The Netherlands},
    apice = {PlIfip74},
    author = {Robert A. Kowalski},
    booktitle = {Information Processing 74 – Proceedings of the 1974 IFIP Congress},
    pages = {569--574},
    publisher = {North-Holland Publishing Company},
    title = {Predicate Logic as Programming Language},
    url = {https://dblp.uni-trier.de/rec/html/conf/ifip/Kowalski74},
    year = 1974
}

@article{autopoiesis-biosystems5,
    apice = {AutopoiesisBiosystems5},
    author = {Varela, Francisco G. and Maturana, Humberto R. and Uribe, R.},
    doi = {10.1016/0303-2647(74)90031-8},
    issn = {0303-2647},
    journal = {BioSystems},
    month = may,
    number = 4,
    pages = {187--196},
    title = {Autopoiesis: The Organization of Living Systems, its Characterization and a Model},
    url = {https://www.sciencedirect.com/science/article/pii/0303264774900318},
    volume = 5,
    year = 1974
}