Search

This is an updated report of the work of the JPEG Committee formed by the International Telecommunication Union (ITU), the International Organization for Standardization (ISO), and the International Electrotechnical Commission (IEC), known as the Joint Photographic Experts Group (JPEG). A detailed introduction to JPEG's work was already presented in Ref. 1. In this report, the focus is more on updated work since 2020 and on new work items and explorations. more...

The International Standardization Committee ISO/IEC JTC1 SC29 WG1, better known as the Joint Photographic Experts Group (JPEG), has a long tradition in the creation of image coding standards. More than 27 years after the release of the first JPEG standard ISO/IEC 10918, the JPEG format stands as a synonym for digital pictures. more...

Riveret et al. have proposed a framework for probabilistic legal reasoning. Their goal is to determine the chance of winning a court case, given the probabilities of the judge accepting certain claimed facts and legal rules. In this paper we tackle the same problem by defining and implementing a new formalism, called probabilistic argumentation logic, which can be seen as a probabilistic generalization of Nute's defeasible logic. Not only does this provide an automation of the — only hand-performed — computations in Riveret et al, it also provides a solution to one of their open problems: a method to determine the initial probabilities from a given body of precedents. ispartof: Theory and Practice of Logic Programming vol:13 issue:4-5 pages:769-781 ispartof: location:ITALY, Ferrara status: published more...

Termination analysis has received considerable attention in Logic Programming for several decades. In recent years, probabilistic extensions of Logic Programming languages have become increasingly important. Languages like PRISM, CP-Logic, ProbLog, and CHRiSM have been introduced and proved very useful for addressing problems in which a combination of logical and probabilistic reasoning is required. As far as we know, the termination of probabilistic logical programs has not received any attention in the community so far. Termination of a probabilistic program is not a crisp notion. Given a query, such a program does not simply either terminate or not terminate, but it terminates with a certain probability. In this paper, we explore this problem in the context of CHRiSM, a probabilistic extension of CHR. We formally introduce the notion of probabilistic termination. We study this concept on the basis of a number of case studies. We provide some initial sufficient conditions to characterize probabilistically terminating programs and queries. We also discuss some challenging examples that reveal the complexity and interest of more general settings. The paper is intended as a first step in a challenging and important new area in the analysis of Logic Programs. ispartof: pages:221-236 ispartof: Lecture Notes in Computer Science vol:7225 pages:221-236 ispartof: Logic-Based Program Synthesis and Transformation, Revised Selected Papers location:Odense, Denmark date:18 Jul - 20 Jul 2011 status: published more...

Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language. CHR-related research has surged during the decade following the previous survey by Fruehwirth. Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions and applications., 49 pages. To appear in Theory and Practice of Logic Programming more...

We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expressiveness of the language. In this paper, we describe an implementation based on source-to-source transformations to CHR (extended with some low-level compiler directives). We allow user-defined aggregates and nested aggregate expressions over arbitrary guarded conjunctions of constraints. Both an on-demand and an incremental aggregate computation strategy are supported. acceptance rate = 43.3% ispartof: pages:59-73 ispartof: Lecture notes in computer science vol:4915 pages:59-73 ispartof: International Symposium on Logic-Based Program Synthesis and Transformation location:Kongens Lyngby, Denmark date:23 Aug - 24 Aug 2007 status: published more...