Towards total scene understanding: Classification, annotation and segmentation in an automatic framework

LJ Li, R Socher, L Fei-Fei - 2009 IEEE Conference on …, 2009 - ieeexplore.ieee.org
Given an image, we propose a hierarchical generative model that classifies the overall
scene, recognizes and segments each object component, as well as annotates the image …

The axiomatic approach to non-classical model theory

R Diaconescu - Mathematics, 2022 - mdpi.com
Institution theory represents the fully axiomatic approach to model theory in which all
components of logical systems are treated fully abstractly by reliance on category theory …

Modelling Service-Oriented Systems and Cloud Services with Heraklit

P Fettke, W Reisig - Advances in Service-Oriented and Cloud Computing …, 2021 - Springer
Modern and next generation digital infrastructures are technically based on service oriented
structures, cloud services, and other architectures that compose large systems from smaller …

40 years of formal methods: Some obstacles and some possibilities?

D Bjørner, K Havelund - International Symposium on Formal Methods, 2014 - Springer
In this “40 years of formal methods” essay we shall first delineate, Sect. 1, what we mean by
method, formal method, computer science, computing science, software engineering, and …

The distributed ontology, modeling and specification language–DOL

T Mossakowski, M Codescu, F Neuhaus… - The Road to Universal …, 2015 - Springer
There is a diversity of ontology languages in use, among them OWL, RDF, OBO, Common
Logic, and F-logic. Related languages such as UML class diagrams, entity-relationship …

Generalised graded interpolation

R Diaconescu - International Journal of Approximate Reasoning, 2023 - Elsevier
We develop an initial study of interpolation for graded consequence relations, which are
many-valued consequence relations that arise in connection to many-valued/fuzzy logics …

Manifest domains: analysis and description

D Bjørner - Formal Aspects of Computing, 2017 - Springer
We show that manifest domains, an understanding of which are a prerequisite for software
requirements prescriptions, can be precisely described: narrated and formalised. We show …

Logical relations and parametricity–a reynolds programme for category theory and programming languages

C Hermida, US Reddy, EP Robinson - Electronic Notes in Theoretical …, 2014 - Elsevier
In his seminal paper on “Types, Abstraction and Parametric Polymorphism,” John Reynolds
called for homomorphisms to be generalized from functions to relations. He reasoned that …

Domain analysis and description principles, techniques, and modelling languages

D Bjørner - ACM Transactions on Software Engineering and …, 2019 - dl.acm.org
We present a method for analysing and describing domains. By a domain we shall
understand a rationally describable segment of a human assisted reality, ie, of the world, its …

Extending Floyd-Hoare logic for partial pre-and postconditions

A Kryvolap, M Nikitchenko, W Schreiner - Information and Communication …, 2013 - Springer
Abstract Traditional (classical) Floyd-Hoare logic is defined for a case of total pre-and
postconditions while programs can be partial. In the chapter we propose to extend this logic …