Mostrar el registro sencillo del ítem
dc.contributor.author | Lucas Alba, Salvador | es_ES |
dc.date.accessioned | 2020-03-30T07:22:14Z | |
dc.date.available | 2020-03-30T07:22:14Z | |
dc.date.issued | 2019-12 | es_ES |
dc.identifier.issn | 0004-3702 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/139771 | |
dc.description.abstract | [EN] The semantics of computational systems (e.g., relational and knowledge data bases, query-answering systems, programming languages, etc.) can often be expressed as (the specification of) a logical theory Th. Queries, goals, and claims about the behavior or features of the system can be expressed as formulas ¿ which should be checked with respect to the intended model of Th, which is often huge or even incomputable. In this paper we show how to prove such semantic properties ¿ of Th by just finding a model A of Th¿{¿}¿Z¿, where Z¿ is an appropriate (possibly empty) theory depending on ¿ only. Applications to relational and deductive databases, rewriting-based systems, logic programming, and answer set programming are discussed. | es_ES |
dc.description.sponsorship | Partially supported by the EU (FEDER), and projects RTI2018-094403-B-C32, PROMETE0/2019/098, and SP20180225. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | Artificial Intelligence | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Automated reasoning | es_ES |
dc.subject | First-Order Logic | es_ES |
dc.subject | Logical models | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Proving semantic properties as first-order satisfiability | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.artint.2019.103174 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/UPV//SP20180225/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/GVA//PROMETEO%2F2019%2F098/ES/DeepTrust: Deep Logic Technology for Software Trustworthiness/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTI2018-094403-B-C32/ES/RAZONAMIENTO FORMAL PARA TECNOLOGIAS FACILITADORAS Y EMERGENTES/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació | es_ES |
dc.description.bibliographicCitation | Lucas Alba, S. (2019). Proving semantic properties as first-order satisfiability. Artificial Intelligence. 277:1-24. https://doi.org/10.1016/j.artint.2019.103174 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1016/j.artint.2019.103174 | es_ES |
dc.description.upvformatpinicio | 1 | es_ES |
dc.description.upvformatpfin | 24 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 277 | es_ES |
dc.subject.asignatura | Análisis y verificación de software 33960 / X - Máster universitario en ingeniería y tecnología de sistemas software 2253 | es_ES |
dc.relation.pasarela | S\393621 | es_ES |
dc.contributor.funder | Generalitat Valenciana | es_ES |
dc.contributor.funder | Agencia Estatal de Investigación | es_ES |
dc.contributor.funder | Universitat Politècnica de València | es_ES |