Filters








3,097 Hits in 5.5 sec

Datalog Unchained

Victor Vianu
2021 Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  
providing an alternative to the classical declarative, model-theoretic semantics.  ...  Datalog variants with forward chaining semantics have been adopted in a variety of settings, including active databases, production systems, distributed data exchange, and data-driven reactive systems.  ...  Special thanks to Serge Abiteboul for revisiting our joint work and providing many useful suggestions for the presentation.  ... 
doi:10.1145/3452021.3458815 fatcat:b6mnoptf2jgdtl27xrt54z7r5u

Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$

Sergio Greco, Domenico Saccà, Carlo Zaniolo
2001 Acta Informatica  
The solution is based on (i) stratified negation as the core of a simple, declarative semantics for negation, (ii) the use of a "choice" construct to capture the nondeterminism of stable models in a disciplined  ...  by the query so that exponential time computation is only required for hard problems.  ...  for nondeterministic semantics, '∃' for possible semantics, '∀' for certain semantics and ∃∀ for definite semantics [31] .  ... 
doi:10.1007/pl00013306 fatcat:44olmfk7srfnrkwis3yvhxanka

A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls

Einar Broch Johnsen, Olaf Owe, Eyvind W. Axelsen
2005 Electronical Notes in Theoretical Computer Science  
However, for prototyping of highly nondeterministic systems, Maude's deterministic engine may be a limitation to practical testing.  ...  The concepts are illustrated by the small object-oriented language Creol and its operational semantics, which is defined using rewriting logic as a semantic framework.  ...  Although the operational semantics is highly nondeterministic, Maude is deterministic in its choice of which rule to apply to a given configuration.  ... 
doi:10.1016/j.entcs.2004.06.012 fatcat:5tigru26pjejplw42velqkfbvu

Transparent Replication Using Metaprogramming in Cyan

Fellipe Augusto Ugliara, Gustavo Maciel Dias Vieira, José de Oliveira Guimarães
2017 Proceedings of the 21st Brazilian Symposium on Programming Languages - SBLP 2017  
Active replication is a form of replication that has strong consistency semantics, easier to reason about and program.  ...  However, creating replicated services using active replication still demands from the programmer the knowledge of subtleties of the replication mechanism.  ...  Acknowledgments This work was supported by the São Paulo Research Foundation (FAPESP) under grant #2014/01817-3 and by FIT -Instituto de Tecnologia.  ... 
doi:10.1145/3125374.3125375 dblp:conf/sblp/UgliaraVG17 fatcat:25wfypqcc5eavhyzoagogmp5yu

Declarative Semantics for Active Rules [article]

Sergio Flesca, Sergio Greco
2003 arXiv   pre-print
In this paper we analyze declarative deterministic and non-deterministic semantics for active rules.  ...  In particular we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max deterministic, unique total stable model, total stable model, and maximal  ...  Work partially supported by the EU projects "Telcal" and "Contact" and by the Murst Project "Interdata".  ... 
arXiv:cs/0312042v1 fatcat:fyzgoxvrhvgctbs75whz4ho5lq

Nondeterminism through well-founded choice

Weidong Chen, Jinghong Zeng
1996 The Journal of Logic Programming  
We present a nondeterministic fixpoint semantics that is sound and complete with respect to the well-founded choice semantics. <l *  ...  Although model-theoretic in nature, the well-founded choice semantics expresses precisely nondeterministic polynomial-time queries (NDB-PTIME).  ...  logics [1] , and a nondeterministic production rule semantics of Datalog extensions [2] .  ... 
doi:10.1016/0743-1066(95)00091-7 fatcat:bdopesvz4bdszmd5wymeeh3hqq

Scheduling-independent threads and exceptions in SHIM

Olivier Tardieu, Stephen A. Edwards
2006 Proceedings of the 6th ACM & IEEE International conference on Embedded software - EMSOFT '06  
We provide the formal semantics of SHIM and a preliminary implementation.  ...  Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments.  ...  Determinism We claim our semantics are deterministic in Kahn's sense: computations and communications are the same for all fair executions.  ... 
doi:10.1145/1176887.1176908 dblp:conf/emsoft/TardieuE06 fatcat:o6cpk5nd4rhm7a7ookuz5vgssq

Concurrent and Reactive Constraint Programming [chapter]

Maurizio Gabbrielli, Catuscia Palamidessi, Frank D. Valencia
2010 Lecture Notes in Computer Science  
In particular, in the topics of semantics, verification, and timed extensions.  ...  : declarative reading, computations as proofs, amenability to meta-programming etc.  ...  In [36] it is defined a framework for the declarative debugging of ntcc programs, which is based on a fixpoint semantics for this language.  ... 
doi:10.1007/978-3-642-14309-0_11 fatcat:jo4qnuehvfggfn3fkugqgmsqpu

Incremental analysis of real programming languages

Tim A. Wagner, Susan L. Graham
1997 SIGPLAN notices  
non-deterministic.  ...  A major research goal for compilers and environments is the automatic derivation of tools from formal specifications.  ...  Merging is performed separately for both symbol and 'rule' (production) nodes. The same approach can be applied in our algorithm, since non-deterministic regions are reconstructed atomically.  ... 
doi:10.1145/258916.258920 fatcat:tk4or7kxrnejjlqqtru6tzsnae

Incremental analysis of real programming languages

Tim A. Wagner, Susan L. Graham
1997 Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation - PLDI '97  
non-deterministic.  ...  A major research goal for compilers and environments is the automatic derivation of tools from formal specifications.  ...  Merging is performed separately for both symbol and 'rule' (production) nodes. The same approach can be applied in our algorithm, since non-deterministic regions are reconstructed atomically.  ... 
doi:10.1145/258915.258920 dblp:conf/pldi/WagnerG97 fatcat:6sdjeqocpjc55f5bskjh4pkiuu

Algebraic approaches to nondeterminism---an overview

Michał Walicki, Sigurd Meldal
1997 ACM Computing Surveys  
In particular, it allows derivation of the standard substitution rule when the substituted terms are deterministic, and prevents substitution of nondeterministic terms for variables.  ...  deterministic semantics).  ... 
doi:10.1145/248621.248623 fatcat:5o2gkoijefg7dgznddcqefpkbi

Symbolic Profiling for Multi-paradigm Declarative Languages [chapter]

Elvira Albert, Germán Vidal
2002 Lecture Notes in Computer Science  
We present the basis of a source-level profiler for multiparadigm declarative languages which integrate features from (lazy) functional and logic programming.  ...  A prototype implementation of the symbolic profiler has been undertaken for the multi-paradigm language Curry.  ...  Acknowledgments We gratefully acknowledge the anonymous referees for many useful suggestions and the participants of LOPSTR 2001 for fruitful feedback.  ... 
doi:10.1007/3-540-45607-4_9 fatcat:evfdm5ru4bc53mhh2t6nbrzl7u

An Approach to Nondeterminism in Translation of CZ Set Theory into Martin-Löf 's Theory of Types

Hassan Haghighi, Seyyed Hassan Mirian Hosseinabadi
2006 Electronical Notes in Theoretical Computer Science  
Therefore, support for nondeterminism should be provisioned in developing programs from their formal specifications.  ...  In this paper, an existing translation of CZ set theory into Martin-Löf's theory of types is extended to consider nondeterministic specifications in CZ language.  ...  Also, in [18] , an approach for using nondeterminate constructs in Martin-Löf's theory of types was presented and deterministic semantics for these constructs were defined.  ... 
doi:10.1016/j.entcs.2005.12.065 fatcat:cb2ufjp5yjcaxmjecmxmid43jy

Modelling and querying interaction networks in the biochemical abstract machine BIOCHAM

F Fages
2002 Journal of Biological Physics and Chemistry  
Based on this formal semantics, the Biocham system offers automated reasoning tools for querying the temporal properties of the system under all its possible behaviours.  ...  In this article we present a formal modelling environment for network biology, called the Biochemical Abstract Machine (BIOCHAM). Biocham delivers precise semantics to biomolecular interaction maps.  ...  ACKNOWLEDGMENTS This work benefitted from various discussions with our colleagues of the ARC CPBIO, in particular with Alexander Bockmayr, Vincent Danos and Vincent Schächter, and of the European project  ... 
doi:10.4024/2040402.jbpc.04.02 fatcat:lqy66ssppnaohjd2f6ggdfxtsu

Probabilistic Confinement in a Declarative Framework

Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
2001 Electronical Notes in Theoretical Computer Science  
Finally, we present an approximating probabilistic semantics which can be used as a base for the analysis of confinement properties, and show its correctness with respect to the operational semantics of  ...  We show how to formulate and analyse some security notions in the context of declarative programming.  ...  The rules are closely related to the ones for (nondeterministic) CCP, and we refer to [2] for a detailed description. Rule R1 describes the effect of tell(c).  ... 
doi:10.1016/s1571-0661(04)00152-5 fatcat:zirdl6ki5raivb26klqbrnnim4
« Previous Showing results 1 — 15 out of 3,097 results