000914800 000__ 05241cam\a2200613Ii\4500
000914800 001__ 914800
000914800 005__ 20230306150543.0
000914800 006__ m\\\\\o\\d\\\\\\\\
000914800 007__ cr\cn\nnnunnun
000914800 008__ 190925s2019\\\\sz\a\\\\o\\\\\101\0\eng\d
000914800 020__ $$a9783030310950$$q(electronic book)
000914800 020__ $$a3030310957$$q(electronic book)
000914800 020__ $$z9783030310943
000914800 0247_ $$a10.1007/978-3-030-31095-0$$2doi
000914800 035__ $$aSP(OCoLC)on1120935082
000914800 035__ $$aSP(OCoLC)1120935082
000914800 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dUKMGB$$dEBLCP
000914800 049__ $$aISEA
000914800 050_4 $$aQA76.9.L63
000914800 08204 $$a005.101/5113$$223
000914800 1112_ $$aRuleML+RR (Joint Conference)$$n(3rd :$$d2019 :$$cBolzano, Italy)
000914800 24510 $$aRules and reasoning :$$bthird International Joint Conference, RuleML+RR 2019, Bolzano, Italy, September 16-19, 2019, Proceedings /$$cPaul Fodor, Marco Montali, Diego Calvanese, Dumitru Roman (eds.).
000914800 2463_ $$aRuleML+RR 2019
000914800 264_1 $$aCham, Switzerland :$$bSpringer,$$c2019.
000914800 300__ $$a1 online resource (xvi, 207 pages) :$$billustrations.
000914800 336__ $$atext$$btxt$$2rdacontent
000914800 337__ $$acomputer$$bc$$2rdamedia
000914800 338__ $$aonline resource$$bcr$$2rdacarrier
000914800 4901_ $$aLecture notes in computer science ;$$v11784
000914800 4901_ $$aLNCS sublibrary. SL 2, programming and software engineering
000914800 500__ $$aInternational conference proceedings.
000914800 500__ $$aIncludes author index.
000914800 5050_ $$aIntro; Preface; Organization; Keynote Talks; The Future of Enterprise AI and Digital Decisions; Existential Rules: A Study Through Chase Termination, FO-Rewritability and Boundedness; Contents; Full Papers; Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes; 1 Introduction; 2 The Lightweight Temporal Logic TELH_[c],lhs; 2.1 A New Temporal Description Logic; 2.2 A Completion Algorithm; 3 Minimal-World Semantics for Metric Temporal Conjunctive Queries with Negation; 3.1 Minimal-World Semantics for MTNCQs; 3.2 A Combined Rewriting for MTNCQs
000914800 5058_ $$a4 Related Work and DiscussionReferences; Reasoning on DL-LiteR with Defeasibility in ASP*-10pt; 1 Introduction; 2 Preliminaries; 3 DL Knowledge Base with Justifiable Exceptions; 4 Datalog Translation for DL-LiteR DKB; 5 Complexity of Reasoning Problems; 6 Discussion and Conclusion; References; ODRL Policy Modelling and Compliance Checking; 1 Introduction; 2 Related Work; 3 Modelling Legislative Requirements and Business Policies Using ODRL; 3.1 Generalising the ODRL Information Model; 3.2 The ODRL Regulatory Compliance Profile; 4 Compliance Checking; 4.1 Institutional Action Language
000914800 5058_ $$a4.2 Data Representation4.3 Policy Representation; 4.4 Explanation Representation; 4.5 Data Transfer Example; 5 Evaluation; 6 Conclusion; References; Aligning, Interoperating, and Co-executing Air Traffic Control Rules Across PSOA RuleML and IDP; 1 Introduction; 2 Knowledge Formalization and Reasoning; 2.1 IDP and the Knowledge Base Paradigm; 2.2 PSOA RuleML for Graph-Relational Knowledge; 3 Air Traffic Control Regulations; 4 Alignment; 4.1 Common Core of the KBs; 5 Interoperation and Co-execution; 5.1 Syntactic Translation for Interoperation; 5.2 Semantics-Preserving Co-execution
000914800 5058_ $$a6 Inconsistencies Within Regulations7 Extensions of the KB; 7.1 Optimization of Landing Order; 7.2 Dependent-Slot ATC KB Version; 8 Conclusions and Future Work; References; An ASP-based Solution for Operating Room Scheduling with Beds Management; 1 Introduction; 2 Background on ASP; 3 Problem Description; 4 ASP Encoding for the Basic ORS Problem; 4.1 OR scheduling; 5 ASP Encoding for ORS with Beds Management; 5.1 OR scheduling with beds; 6 Experimental Results; 6.1 ORS Benchmarks; 6.2 Results; 7 Related Work; 8 Conclusions; References
000914800 5058_ $$aEASE: Enabling Hardware Assertion Synthesis from English1 Introduction; 2 EASE Architecture; 2.1 Dependency Grammar and Lexicon; 2.2 Clause Relationship Tree; 2.3 Syntactic-Semantic Parsing; 2.4 Suggestion Generation; 3 Evaluation; 4 Conclusion; References; Formalizing Object-Ontological Mapping Using F-logic; 1 Introduction; 1.1 Running Example; 2 Background; 2.1 SROIQ; 2.2 Integrity Constraints; 2.3 F-logic; 3 Mapping; 4 Mapping Integrity Constraints; 4.1 Integrity Constraint Semantics; 4.2 Integrity Constraint Validation; 5 Related Work; 5.1 Application Access to Ontologies
000914800 506__ $$aAccess limited to authorized users.
000914800 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 25, 2019).
000914800 650_0 $$aComputer logic$$vCongresses.
000914800 650_0 $$aComputer programming$$vCongresses.
000914800 650_0 $$aSoftware engineering$$vCongresses.
000914800 650_0 $$aLogic, Symbolic and mathematical$$vCongresses.
000914800 650_0 $$aArtificial intelligence$$vCongresses.
000914800 7001_ $$aFodor, Paul,$$eeditor.
000914800 7001_ $$aMontali, Marco,$$eeditor.
000914800 7001_ $$aCalvanese, Diego,$$eeditor.
000914800 7001_ $$aRoman, Dumitru,$$eeditor.
000914800 830_0 $$aLecture notes in computer science ;$$v11784.
000914800 830_0 $$aLNCS sublibrary.$$nSL 2,$$pProgramming and software engineering.
000914800 852__ $$bebk
000914800 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-31095-0$$zOnline Access$$91397441.1
000914800 909CO $$ooai:library.usi.edu:914800$$pGLOBAL_SET
000914800 980__ $$aEBOOK
000914800 980__ $$aBIB
000914800 982__ $$aEbook
000914800 983__ $$aOnline
000914800 994__ $$a92$$bISE