{"type":"ScholarlyArticle","title":"Constructive Second-Order Proofs in Logical Databases","authors":[{"name":"Michel de Rougemont","slug":"michel-de-rougemont","given":"Michel","family":"de Rougemont","affiliation":""}],"abstract":"The constructive second-order proofs that we study are associated with inductive definitions on classes of finite s tructures , where each structure represents a database state. To an inductive definition of a predicate P on a class K corresponds a uniform proof of P i.e. a function which for each structure U defines a proof of P in U. These proofs use computations on sets and the finiteness of the structures in a fundamental way , and hence differ from fU\"st-order proofs. We show the non-monotonicity of thi s calculus, and mention the constructivity of some of its intensional properties (time and space complexities) .","doi":null,"url":"https://ijcai.org/proceedings/1987/205","pdf":"https://ijcai.org/proceedings/1987/0205.pdf","markdown":"https://ijcai.org/proceedings/1987/205.md","bibtex":"https://ijcai.org/proceedings/1987/bibtex/205","volume":{"slug":"1987","title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1987","url":"https://ijcai.org/proceedings/1987/","year":1987,"location":"Milan, Italy","dates":"","editors":"John McDermott","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Reasoning","track":"Reasoning","number":205,"pages":{"first":993,"last":995},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}