A new proof of undecidability of safety of logic queries
Luigi Palopoli · ACM SIGACT News · 1990
article A new proof of undecidability of safety of logic queries Share on Author: Luigi Palopoli CRAI, Consorzio per la Ricerca e le Applicazioni di Informatica, 87036 Rende (CS), Ital y CRAI, Consorzio per la Ricerca e le Applicazioni di Informatica, 87036 Rende (CS), Ital yView Profile Authors Info & Claims ACM SIGACT NewsVolume 21Issue 4Fall 1990 pp 69–72https://doi.org/10.1145/101371.101373Online:01 November 1990Publication History 0citation111DownloadsMetricsTotal Citations0Total Downloads111Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access