Snelrecht en de ZSM-aanpak

Er wordt een overzicht gegeven van de verschillende vormen van snelrecht. Daarnaast worden de plannen van de regering besproken om binnen enkele jaren twee derde van alle eenvoudige (overlast veroorzakende) strafzaken binnen een maand af te handelen. In dat verband wordt m.n. nader ingegaan op de zgn. ZSM-aanpak en het Veiligheidshuis. Ten slotte worden de voor- en nadelen van het beoogde 'lik op stuk beleid' afgewogen en wordt daaruit de conclusie getrokken dat de plannen om veel voorkomende zaken versneld af te doen, zo gek nog niet zijn. Mits bepaalde voorstellen nog eens worden heroverwogen en mits bepaalde fundamentele uitgangspunten van ons recht voldoende in acht worden genomen

Reasoning & Querying – State of the Art

Various query languages for Web and Semantic Web data, both for practical use and as an area of research in the scientific community, have emerged in recent years. At the same time, the broad adoption of the internet where keyword search is used in many applications, e.g. search engines, has familiarized casual users with using keyword queries to retrieve information on the internet. Unlike this easy-to-use querying, traditional query languages require knowledge of the language itself as well as of the data to be queried. Keyword-based query languages for XML and RDF bridge the gap between the two, aiming at enabling simple querying of semi-structured data, which is relevant e.g. in the context of the emerging Semantic Web. This article presents an overview of the field of keyword querying for XML and RDF

Extended RDF: Computability and Complexity Issues

ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. Based on the undecidability result of ERDF stable model semantics, decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a slightly modified semantics for ERDF ontologies, called ERDF #n- stable model semantics. We show that entailment under this semantics is, in general, decidable and also extends RDFS entailment. Equivalence statements between the two semantics are provided. Additionally, we provide algorithms that compute the ERDF #n-stable models of syntax-restricted and general ERDF ontologies. Further, we provide complexity results for the ERDF #nstable model semantics on syntax-restricted and general ERDF ontologies. Finally, we provide complexity results for the ERDF stable model semantics on syntax-restricted ERDF ontologies

De koop- / aannemingsovereenkomst: Koop en / of aanneming?

Coherent privaatrech

De koop-/aannemingsovereenkomst: koop en/of aanneming?

Coherent privaatrech