Filters








29,136 Hits in 4.1 sec

An Ontology-Based Approach for Evaluating the Domain Appropriateness and Comprehensibility Appropriateness of Modeling Languages [chapter]

Giancarlo Guizzardi, Luís Ferreira Pires, Marten van Sinderen
2005 Lecture Notes in Computer Science  
Relation between conceptualization, abstraction, modeling language and model.  ...  If isomorphism can be guaranteed, the implication for the human agent who interprets a diagram (model) is that his interpretation correlates precisely and uniquely with an abstraction being represented  ...  We would like to thank Gerd Wagner, Nicola Guarino and Chris Vissers for fruitful discussions and for providing valuable input to the issues of this article.  ... 
doi:10.1007/11557432_51 fatcat:y7tvsrx5znaibcyrvue4ddsd2a

Semi-Automatic Merging of Ontologies using Protégé

Ayesha Ameen, Khaleel Ur Rahman Khan, B. Padmaja Rani
2014 International Journal of Computer Applications  
Ontologies are developed at different levels of abstraction and by different people for various purposes.  ...  In this paper we have shown the merger of two ontologies first ontology is university second ontology is the Student profile ontology containing details of Student which were developed in educational domain  ...  Proper utilization of ontologies is very important for the Semantic Web vision. Much ontology exists in every domain at various level of abstraction representing the same concepts.  ... 
doi:10.5120/14895-3366 fatcat:e4axo5ipf5e5hpnj6zbsqtweju

States vs. Traces in Model Checking by Abstract Interpretation [chapter]

Roberto Giacobazzi, Francesco Ranzato
2002 Lecture Notes in Computer Science  
In POPL'00, Cousot and Cousot showed that the classical state-based model checking of a very general temporal language called µ -calculus is an incomplete abstract interpretation of its trace-based semantics  ...  The following consequence can be drawn: there is no way to either refine or abstract sets of states in order to get a model checking algorithm for (any fragment allowing conjunctions of) the µ -calculus  ...  This work has been partially supported by the Italian MIUR Cofin2000 project "Abstract interpretation, type systems and control-flow analysis".  ... 
doi:10.1007/3-540-45789-5_32 fatcat:mn7rsnqalzdn7fwbpmfwbojhwa

Using the Unified Foundational Ontology (UFO) as a Foundation for General Conceptual Modeling Languages [chapter]

Giancarlo Guizzardi, Gerd Wagner
2010 Theory and Applications of Ontology: Computer Applications  
the purpose of conceptual modeling. particular, this framework focuses on two properties of modeling languages [1]: (i) domain appropriateness, which refers to truthfulness of a language to a given domain  ...  ., software and domain engineering, database and information systems design) counts in favor or the practicality and relevance of this approach.  ...  In [1] , we also provide a methodological framework for systematically assessing these properties given a language and a domain.  ... 
doi:10.1007/978-90-481-8847-5_8 fatcat:uif2t75zevbchfy27dmdiwxfl4

All the existences that there are

Alberto Voltolini
2012 Disputatio  
) and a formal, hence universal, first-order property.  ...  I will first try to show what these properties are and why we need all of them for ontological purposes.  ...  For in (12)'s antecedent, 'exists' means the formal property, so that that antecedent may be seen as saying that there is a unique perfect being and this individual formally exists.  ... 
doi:10.2478/disp-2012-0004 fatcat:zporzgvye5dj7og75tpn5lts6e

Specification transformers: a predicate transformer approach to composition

Michel Charpentier, K. Mani Chandy
2004 Acta Informatica  
ii) deducing desirable properties of components from the system specification and properties of the composition operator.  ...  This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and the composition operator, and (  ...  Existential and universal properties are used for bottom-up reasoning. Their dual are used in top-down reasoning. -Bottom-up.  ... 
doi:10.1007/s00236-003-0130-y fatcat:rxa47tvutfejpg5bvogzoppsoq

Scope and Binding: Semantic Aspects [chapter]

A. Szabolcsi
2006 Encyclopedia of Language & Linguistics  
Existential scope and distributive scope are distinguished, and E-type anaphora and covariance with situations are added to traditional bound variable and coreferential readings.  ...  It turns out that different operators have different scoping and binding abilities. At least three classes emerge: unmodified indefinites, distributive universals, and counting quantifiers.  ...  Going beyond first order logic, lambda is the abstraction operator and P a second-order variable over properties. (7) λP∀x[boy'(x)→ P(x)](λy∃z[picture'(z) ∧ showed'(y, father-of'(y), z)]) Although the  ... 
doi:10.1016/b0-08-044854-2/01072-5 fatcat:6hvfvemi2bc43ox2mnpfds5quu

On the Completeness of Model Checking [chapter]

Francesco Ranzato
2001 Lecture Notes in Computer Science  
Giacobazzi et al. [8] observed that completeness for an abstract interpretation, i.e. abstract domains plus abstract operations, only depends on the underlying abstract domains.  ...  µ -calculus temporal formula φ to the set of present states s of M such that any (here we are considering the universal case: dually, in the existential checking abstraction "any" becomes "some") execution  ...  I wish to thank Roberto Giacobazzi for the many helpful discussions we had on May 2000 in Place des Vosges, and Radhia Cousot for hosting me at LIX,École Polytechnique, Palaiseau, on May 2000.  ... 
doi:10.1007/3-540-45309-1_10 fatcat:f2c2v7tfkndybepwkjwtajry4y

Software Verification of Hyperproperties Beyond k-Safety [article]

Raven Beutner, Bernd Finkbeiner
2022 arXiv   pre-print
This combination of universal and existential quantification allows us to express many properties beyond k-safety, including, for example, generalized non-interference or program refinement.  ...  Our method is based on a strategy-based instantiation of existential trace quantification combined with a program reduction, both in the context of a fixed predicate abstraction.  ...  Acknowledgments This work was partially supported by the DFG in project 389792660 (Center for Perspicuous Systems, TRR 248). R.  ... 
arXiv:2206.03381v1 fatcat:rx7aeumilrd2jntfjkb5tqgoja

Refining Existential Properties in Separation Logic Analyses [article]

Matko Botinčan, Mike Dodds, Stephen Magill
2015 arXiv   pre-print
We define domains for several classes of existential properties, and show their effectiveness on case studies adapted from Redis, Azureus and FreeRTOS.  ...  In this paper, we propose a CEGAR-like method for detecting spurious failures and avoiding them by refining the abstract domain.  ...  [9] gives a widening for shape domains, but this widening does not account for data, nor explicitly track existential properties.  ... 
arXiv:1504.08309v1 fatcat:icrjvag6zrg5rpw3rvpzhgdska

Constraints to Validate RDF Data Quality on Common Vocabularies in the Social, Behavioral, and Economic Sciences [article]

Thomas Hartmann, Benjamin Zapilko, Joachim Wackerow, Kai Eckert
2015 arXiv   pre-print
of responses to studies and archived for research purposes.  ...  The RDF Data Cube Vocabulary (QB) is a W3C recommendation for expressing data cubes, i.e. multi-dimensional aggregate data and its metadata.  ...  are defined for each PHDD object and data property. ‚ Severity level: ERROR -SKOS-C-UNIVERSAL-QUANTIFICATIONS-01: Universal quantifications are defined for each SKOS object and data property.  ... 
arXiv:1504.04479v3 fatcat:pfmfvon26nczbeixircqwobw2e

Abstract interpretation of reactive systems

Dennis Dams, Rob Gerth, Orna Grumberg
1997 ACM Transactions on Programming Languages and Systems  
In this article, we extend Abstract Interpretation to the analysis of both existential and universal reactive properties, as expressible in the modal µ-calculus.  ...  The theory of Abstract Interpretation offers a framework for the definition and justification of property-preserving abstractions.  ...  ACKNOWLEDGEMENTS We thank Susanne Graf for many interesting and stimulating discussions, and Nissim Francez for his helpful comments. Anthony McIsaac pointed out some mistakes.  ... 
doi:10.1145/244795.244800 fatcat:xspftndyrvg65gzaydvrvtw2ti

A Symbolic Semantics for Abstract Model Checking [chapter]

Francesca Levi
1998 Lecture Notes in Computer Science  
The relations of non-deterministic and alternative choices turn out to be very useful for the dual approximations of the existential next modality.  ...  We present a finite symbolic semantics of value-passing concurrent processes, that can be suitably interpreted over abstract values to compute a lower approximate semantics of full µ-calculus.  ...  existential and the universal next modality.  ... 
doi:10.1007/3-540-49727-7_8 fatcat:zf43px7muza2dbyormuphis3tm

An Abstract Interpretation Perspective on Linear vs. Branching Time [chapter]

Francesco Ranzato, Francesco Tapparo
2005 Lecture Notes in Computer Science  
In this paper we reason on a generic abstraction α over a domain A of a generic linear time language L.  ...  In abstract interpretation terms, it turns out that the universal path quantifier abstraction of LTL is incomplete.  ...  abstraction of of the existential/universal domain ℘(M ) ⊆/⊇ of sets of paths.  ... 
doi:10.1007/11575467_6 fatcat:ykxvnrkx4rbsfn4cddmqbh5jw4

Some remarks on Hugh MacColl's notion of symbolic existence

Shahid Rahman
2011 Philosophia Scientiæ  
On the other hand, they are abstract creations like marriages, universities and theoretical entities postulated by physical theories.  ...  Acknowledgments Many thanks to Amirouche Moktefi for his unflagging patience and encouragement and to the very helpful remarks, suggestions and corrections of two anonymous referees. elephants or galaxies  ...  This holds in particular for (definite and indefinite) descriptions, that is, noun phrases of the form "the/an object with such-and-such properties".  ... 
doi:10.4000/philosophiascientiae.370 fatcat:yn22x3ydmrbsjp4653atrmrr3a
« Previous Showing results 1 — 15 out of 29,136 results