Results 51 to 60 of about 5,812 (235)
Ontologies for Sustainability: Theoretical Challenges
ABSTRACT The lack of sustainable practices in key sectors of human societies is a global concern, posing threats for the whole planet. This paper provides the first review of ontologies for sustainability efforts, outlining their roles in assessing and advancing such efforts. Section 2 outlines three major challenges associated with sustainability: (1)
Giorgio A. Ubbiali +2 more
wiley +1 more source
Contemporary artificial intelligence (AI) technologies are often presumed to be capable of revealing unmediated truths about the world, including the truths language might hold, echoing the long‐standing assertion that language's primary function is to directly translate reality.
Beth M. Semel
wiley +1 more source
Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities
Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev +14 more
wiley +1 more source
Attribute Annotations and Their Use in C Program Deductive Verification
In this paper a new kind of annotations, called attribute annotations, and the methodology for their application in a deductive program verification are proposed.
M. M. Atuchin, I. S. Anureev
doaj
Establishing Shape Correspondences: A Survey
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
An Axiomatic Semantics for Data-Parallel Computation [PDF]
Proof rules for both directly and indirectly indexed data-parallel array assignment are presented. Consequently, the correctness of two programs, (i) a representation of Cannon's algorithm and (ii) sparse matrix-vector multiplication, are established by application of the rules.
openaire +2 more sources
We introduce Recognition Geometry (RG), an axiomatic framework in which geometric structure is not assumed a priori but derived. The starting point of the theory is a configuration space together with recognizers that map configurations to observable ...
Jonathan Washburn +2 more
doaj +1 more source
The investigation aim - precise formulating and solving the problem of provability or improvability of statement of existence of God, and also of provability or improvability of negation of this statement in a formal axiomatic system of philosophical ...
Lobovikov V.O.
doaj +1 more source
Abstract In this essay I contend that, whatever one might say about F.W.J. Schelling's historical and conceptual influence on Paul Tillich's doctrines, the overall style of Tillich's project can helpfully be dubbed Schellingian to the extent it mixes together discourses, genres, and vocabularies into an ever‐expanding whole. To the extent that anything
Daniel Whistler
wiley +1 more source
Paraconsistent Labeling Semantics for Abstract Argumentation
Dung’s abstract argumentation framework is a popular formalism in formal argumentation. The present work develops paraconsistent labeling semantics for abstract argumentation such that the incomplete and inconsistent information can be expressed, and it ...
Yuanlei Lin
doaj +1 more source

