Results 1 - 10 of 45

Expressive Power of Non-Deterministic Operators for Logic-Based Languages

by Luca Corciulo, Fosca Giannotti, Dino Pedreschi, Carlo Zaniolo - in Proc.2nd ICLP Workshop on Deductive Databases and Logic Programming, Santa Margherita Ligure , 1994
"... Non-deterministic operators are needed in First-Order relational languages and Datalog to extend the expressive power of such languages and support efficient formulations of low complexity problems. In this paper, we study the operators proposed in the literature, including witness, lazy choice and ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Non-deterministic operators are needed in First-Order relational languages and Datalog to extend the expressive power of such languages and support efficient formulations of low complexity problems. In this paper, we study the operators proposed in the literature, including witness, lazy choice

ACL - A Concurrent Linear Logic Programming Paradigm

by Naoki Kobayashi, Akinori Yonezawa - Proceedings of the 1993 International Logic Programming Symposium , 1993
"... We propose a novel concurrent programming framework called ACL. ACL is a variant of linear logic programming, where computation is described in terms of bottom-up proof search of some formula in linear logic. The whole linear sequent calculus is too non-deterministic to be interpreted as an operatio ..."
Abstract - Cited by 50 (5 self) - Add to MetaCart
We propose a novel concurrent programming framework called ACL. ACL is a variant of linear logic programming, where computation is described in terms of bottom-up proof search of some formula in linear logic. The whole linear sequent calculus is too non-deterministic to be interpreted

Reasoning about Action and Change - A Dynamic Logic Approach

by Helmut Prendinger, Gerhard Schurz - Journal of Logic, Language, and Information , 1996
"... this paper, we pursue a monotonic approach to the frame problem and concentrate on the combinatorial problem and the overcommitment problem. We will propose a solution within the framework of propositional dynamic logic (PDL)---the modal logic of actions and of computer programs (see Pratt, 1976, 19 ..."
Abstract - Cited by 31 (0 self) - Add to MetaCart
) execution of ff, A is true." PDL provides a powerful language for describing compound actions such as sequential composition of actions ff and fi, written ff; fi, (non-deterministic) choice between ff and fi, written ff + fi, and (nondeterministic) iteration of ff, written ff

Distributed Programming in a Multi-Paradigm Declarative Language

by Michael Hanus - In Proc. of the International Conference on Principles and Practice of Declarative Programming (PPDP’99 , 1702
"... Abstract. Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expressions extended by a possibly non-deterministic binding of free variables occurring in expressions. Moreover, co ..."
Abstract - Cited by 42 (21 self) - Add to MetaCart
Abstract. Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expressions extended by a possibly non-deterministic binding of free variables occurring in expressions. Moreover

Embedding Extensional Finite Sets in CLP

by Agostino Dovier, Gianfranco Rossi , 1993
"... In this paper we review the definition of {log} 1, a logic language with sets, from the viewpoint of CLP. We show that starting with a CLP-scheme allows a more uniform treatment of the built-in set operations (namely, =, ∈ and their negative counterparts), and allows all the theoretical results of ..."
Abstract - Cited by 26 (17 self) - Add to MetaCart
of CLP to be immediately exploitable. We prove this by precisely defining the privileged interpretation domain and the axioms of the selected set theory. Then we define a non-deterministic procedure for checking constraint satisfiability based on the reduction of a given constraint to a collection

Author manuscript, published in "ICDT (2012) 46-60" Highly Expressive Query Languages for Unordered Data Trees ∗

by Serge Abiteboul, Pierre Bourhis, Victor Vianu , 2012
"... We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay ..."
Abstract - Add to MetaCart
of different factors: the expressive power of basic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeterministic control. All languages are Turing complete, but not necessarily query complete in the sense of Chandra and Harel. Indeed, we show that some

Applying the Mu-Calculus in Planning and Reasoning about Action

by Munindar P. Singh
"... Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified set of states. More general approaches for planning based on temporal logic (TL) are emerging. Current approaches tend to us ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
to use linear TL, and can handle sets of sequences of states. However, they assume deterministic actions with all changes effected solely by one agent. By contrast, we use a branching model of time that can express concurrent actions by multiple agents and the environment, leading to nondeterministic

QOS WITH RELIABILITY AND SCALABILITY IN ADAPTIVE SERVICE-BASED SYSTEMS

by V. Rhymend, Uthariaraj P. Mercy, Florence A. Geetha
"... Service-based systems that are dynamically composed at runtime to provide complex, adaptive functionality are currently one of the main development paradigms in software engineering. However, the Quality of Service (QoS) delivered by these systems remains an important concern, and needs to be manage ..."
Abstract - Add to MetaCart
that achieve their QoS requirements through dynamically adapting to changes in the system state, environment, and workload. QoSMOS service-based systems translate high-level QoS requirements specified by their administrators into probabilistic temporal logic formulae, which are then formally and automatically

Figure 1

by Yuan Mei, Samuel Madden
"... Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attention in a variety of areas due to their powerful and expressive query language and performance potential. Sequentiality (tem ..."
Abstract - Add to MetaCart
, disjunction, negation and Kleene closure. Unlike most recently proposed CEP systems, which use non-deterministic finite automata (NFA’s) to detect patterns, ZStream uses tree-based query plans for both the logical and physical representation of query patterns. By carefully designing the underlying

(Invited Paper)

by Salvatore Tomaselli, Olaf L, Salvatore Tomaselli, Olaf L , 2013
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract - Add to MetaCart
pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Results 1 - 10 of 45