253,503 Hits in 8.9 sec

Towards closed world reasoning in dynamic open worlds

2010 Theory and Practice of Logic Programming  
These semantics have matured over the years, but only provide solutions for the static case when knowledge does not need to evolve.In this paper we take a first step towards addressing the dynamics of  ...  AbstractThe need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web.  ...  While revision deals with incorporating new information about a static world, update takes place when changes occurring in a dynamic world are recorded.  ... 
doi:10.1017/s147106841000027x fatcat:bdgfmyvw6rcvvgswcauujpu67a

Gradual Type Theory (Extended Version) [article]

Max S. New, Daniel R. Licata, Amal Ahmed
2018 arXiv   pre-print
In this paper, we propose an axiomatic account of program equivalence in a gradual cast calculus, which we formalize in a logic we call gradual type theory (GTT).  ...  While existing gradual type soundness theorems for these languages aim to show that type-based reasoning is preserved when moving from the fully static setting to a gradual one, these theorems do not imply  ...  hand, we can prove that all of our logical relations (open and closed) are transitive in the limit.  ... 
arXiv:1811.02440v1 fatcat:6vp4p5xmm5c2hhxpfcuyjch22e

OpenGeoBase: Information Centric Networking meets Spatial Database applications - Extended Version [article]

Andrea Detti, Nicola Blefari Melazzi, Michele Orru, Riccardo Paolillo, Giulio Rossi
2016 arXiv   pre-print
We also show how OpenGeoBase can support a real world Intelligent Transport System application, by enabling discovery of geo-referenced public transportation information.  ...  Thanks to ICN, OpenGeoBase can quickly and efficiently provide information to database users; easily operate in a distributed way, deploying and using many database engines in parallel; secure every piece  ...  In this version of OGB we preferred to avoid these ICN architectural changes and do not adopt these approaches.  ... 
arXiv:1607.00771v3 fatcat:5br3wwg3wbdpvbsxymk2mfmg5u

Reference Exascale Architecture (Extended Version)

Martin Bobák, Ladislav Hluchý, Ondrej Habala, Viet Tran, Reginald Cushing, Onno Valkering, Adam Belloum, Mara Graziani, Henning Müller
2020 Computing and informatics  
terms of continuously increasing data as well as an increase in parallel requests being sent.  ...  While the first exascale machines are likely to be built within a single site, the input data is in many cases impossible to store within a single site.  ...  The PROCESS architecture shows how the exascale platforms look in the real world. It was introduced in [6] and extended by a micro-services approach which is described in the following text.  ... 
doi:10.31577/cai_2020_4_644 fatcat:zd5mo3zunzgtbpf4saer32uko4

A Sound and Complete Hoare Logic for Dynamically-Typed, Object-Oriented Programs -- Extended Version -- [article]

Björn Engelmann, Ernst-Rüdiger Olderog
2016 arXiv   pre-print
A structural operational semantics as well as a Hoare-style program logic for reasoning about programs in the language in multiple notions of correctness are given.  ...  A simple dynamically-typed, (purely) object-oriented language is defined.  ...  Acknowledgements: We thank Dennis Kregel for noticing that restricting r causes incompleteness and him, Nils-Erik Flick and the anonymous referees for many useful comments on prior versions of this paper  ... 
arXiv:1509.08605v3 fatcat:u6debwbcwbdmlgilxelxtz6tku

Classical Dynamics from Self-Consistency Equations in Quantum Mechanics – Extended Version [article]

J.-B. Bru, W. de Siqueira Pedra
2021 arXiv   pre-print
This leads to a mathematical framework in which the classical and quantum worlds are naturally entangled.  ...  As a matter of fact, in general commutative C^∗-algebras, even the closableness of unbounded symmetric derivations is a non-trivial issue.  ...  Breteaux for having pointed out many typos and who meanwhile suggested various improvements during his very detailed reading of the first version of this paper.  ... 
arXiv:2009.04969v2 fatcat:axhyjklmj5fvxgtucnejjn4czq

Determining Relevance of Accesses at Runtime (Extended Version) [article]

Michael Benedikt, Georg Gottlob, Pierre Senellart
2011 arXiv   pre-print
We are interested in dynamic aspects of the query answering problem: given partial information about the data, which accesses could provide relevant data for answering a given query?  ...  In the process, we relate dynamic relevance of an access to query containment under access limitations and characterize the complexity of this problem; we produce several complexity results about containment  ...  Benedikt is supported in part by EP/G004021/1 and EP/H017690/1 of the Engineering and Physical Sciences Research Council UK and in part by EC FP7-ICT-233599. G. Gottlob's and P.  ... 
arXiv:1104.0553v3 fatcat:d6ljizgtrnhfnhlbnj2gknmzs4

Maximizing Coverage Centrality via Network Design: Extended Version [article]

Sourav Medya, Arlei Silva, Ambuj Singh, Prithwish Basu, Ananthram Swami
2017 arXiv   pre-print
Network centrality plays an important role in many applications.  ...  Central nodes in social networks can be influential, driving opinions and spreading news or rumors.In hyperlinked environments, such as the Web, where users navigate via clicks, central content receives  ...  TOWARDS MORE GENERAL SETTINGS We start by extending our approaches to solve the Coverage Centrality optimization problem on directed graphs (e.g. our motivating example in Figure 1 ).  ... 
arXiv:1702.04082v3 fatcat:za73sfucdbb2xhrfj7uflddm2q

SLAP: Simultaneous Localization and Planning Under Uncertainty for Physical Mobile Robots via Dynamic Replanning in Belief Space: Extended version [article]

Ali-akbar Agha-mohammadi, Saurav Agarwal, Sung-Kyun Kim, Suman Chakravorty, Nancy M. Amato
2018 arXiv   pre-print
This paper addresses this problem and proposes a dynamic replanning scheme in belief space.  ...  The underlying POMDP, which is continuous in state, action, and observation space, is approximated offline via sampling-based methods, but operates in a replanning loop online to admit local improvements  ...  In this paper, we extend our previous work on FIRM by proposing a dynamic replanning scheme in belief space that enables online replanning for real world applications in mobile robotics.  ... 
arXiv:1510.07380v3 fatcat:ijsimq3tsbhq7cbypgmqufypre

Towards Crowd-aware Indoor Path Planning (Extended Version) [article]

Tiantian Liu, Huan Li, Hua Lu, Muhammad Aamir Cheema, Lidan Shou
2021 arXiv   pre-print
Such crowds in turn influence people's routing choices, e.g., people may prefer to avoid crowded rooms when walking from A to B.  ...  Second, a time-evolving population estimator derives room populations for a future timestamp to support crowd-aware routing cost computations in query processing.  ...  ACKNOWLEDGMENTS This work is an extension of the paper entitled "Towards Crowdaware Indoor Path Planning" published at VLDB 2021.  ... 
arXiv:2104.05480v2 fatcat:atjhpl2rpner5j2utmxolc7yee

Fencing off Go: Liveness and Safety for Channel-based Programming (extended version) [article]

Julien Lange and Nicholas Ng and Bernardo Toninho and Nobuko Yoshida
2017 arXiv   pre-print
Note: This is a revised extended version of a paper that appeared in POPL 2017, see page 13 for details.  ...  including those with dynamic channel creation, unbounded thread creation and recursion.  ...  Acknowledgments We gratefuly acknowledge Naoki Kobayashi for finding flaws in Sections 4 and 5 in earlier versions of this work; as well as for detailed comments on Sections 7 and 8.  ... 
arXiv:1610.08843v3 fatcat:rnlqdeouuneyjidqmqj6muaczi

Cache-Efficient Sweeping-Based Interval Joins for Extended Allen Relation Predicates (Extended Version) [article]

Danila Piatov, Sven Helmer, Anton Dignös, Fabio Persia
2020 arXiv   pre-print
Our technique is based on a framework, components of which can be flexibly combined in different manners to support the required interval relation.  ...  In temporal databases, our algorithms can exploit a well-known and flexible access method, the Timeline Index, thus expanding the set of operations it supports even further.  ...  This can be expressed in our extended relational algebra in the following way: r • start s.  ... 
arXiv:2008.12665v1 fatcat:li2oxf7atzcf7bmqdafi76uy6y

Symbolic Reasoning for Automatic Signal Placement (Extended Version) [article]

Kostas Ferles, Jacob Van Geffen, Isil Dillig, Yannis Smaragdakis
2018 arXiv   pre-print
We have implemented our method in a tool called Expresso and evaluate it on challenging benchmarks from prior papers and open-source software.  ...  Explicit signaling between threads is a perennial cause of bugs in concurrent programs.  ...  The first three authors of this paper are supported in part by NSF Award #1712060, NSF Award #1453386, AFRL Award #8750-15-2-0096, and the last author is supported by ERC grant 307334 (SPADE), a Facebook  ... 
arXiv:1804.02503v1 fatcat:3vtogbrkxbam3oklb6glwgebea

Automatic Root Cause Quantification for Missing Edges in JavaScript Call Graphs (Extended Version) [article]

Madhurima Chakraborty, Renzo Olivares, Manu Sridharan, Behnaz Hassanshahi
2022 arXiv   pre-print
We found that while dynamic property accesses were the most common root cause of missed edges across the benchmarks, other root causes varied in importance depending on the benchmark, potentially useful  ...  Building sound and precise static call graphs for real-world JavaScript applications poses an enormous challenge, due to many hard-to-analyze language features.  ...  Dynamic Flow Traces Beyond dynamic call graphs, our technique requires dynamic flow traces to find gaps in the data flow reasoning of static call graph builders.  ... 
arXiv:2205.06780v1 fatcat:evz3lan365c7xf4dlzoybjlipu

Towards Analytics Aware Ontology Based Access to Static and Streaming Data (Extended Version) [article]

Evgeny Kharlamov, Yannis Kotidis, Theofilos Mailis, Christian Neuenstadt, Charalampos Nikolaou, Özgür Özcep, Christoforos Svingos, Dmitriy Zheleznyakov, Sebastian Brandt, Ian Horrocks, Yannis Ioannidis, Steffen Lamparter, Ralf Möller
2016 arXiv   pre-print
Based on our experience with Siemens, we argue that in order to overcome those limitations OBDA should be extended and become analytics, source, and cost aware.  ...  Real-time analytics that requires integration and aggregation of heterogeneous and distributed streaming and static data is a typical task in many industrial scenarios such as diagnostics of turbines in  ...  Regarding the semantics of STARQL, it combines open and closed-world reasoning and extends snapshot semantics for window operators [19] with sequencing semantics that can handle integrity constraints  ... 
arXiv:1607.05351v2 fatcat:3vfhmj4tabddtptampyd2riv7q
« Previous Showing results 1 — 15 out of 253,503 results