470 Hits in 5.0 sec

The Cartesian approach to context

John Plaice, Blanca Mancilla
2010 Proceedings of the 2nd International Workshop on Context-Oriented Programming - COP '10  
of tasks in a subsystem, corresponds to one tick of the system.  ...  The importance of this dimension relies on the fact that its proper handling will allow the control of software evolution, of systems, and of system instances or views; partial changes or updates to specific  ...  The TransLucid infinite data structures are obviously not constructible in a physical computer, hence their evaluation is lazy.  ... 
doi:10.1145/1930021.1930024 dblp:conf/ecoop/PlaiceM10 fatcat:rmdils6b35gxfmhizlqd4kymk4

Degeneracy and Instability in Geometric Computation [chapter]

Kokichi Sugihara
2001 Geometric Modelling  
Merits and demerits of the two approaches are discussed with examples.  ...  One promising approach to this difficulty is the use of multiple precision arithmetic that is high enough to judge the topological structure always correctly.  ...  The lazy-evaluation scheme seems to contain still many potential variants, and we have to search for more efficient realization of this scheme.  ... 
doi:10.1007/978-0-387-35490-3_1 fatcat:mllkwvn7ibf7rkptzgrje5t4ha

Time in State Machines

Susanne Graf, Andreas Prinz
2005 International Workshops on Abstract State Machines  
State machines are considered a very general means of expressing computations in an implementation-independent way.  ...  There are also ways to extend the general state machine framework with distribution aspects. However, there is still no agreement when it comes to handling time in this framework.  ...  In order to achieve the "lazy" interpretation of all transitions, no additional axiom is needed.  ... 
dblp:conf/asm/GrafP05 fatcat:4uzdyocugfcnfnljbxzux2ydze

SMT Solving for Functional Programming over Infinite Structures

Bartek Klin, Michał Szynwelski
2016 Electronic Proceedings in Theoretical Computer Science  
We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational  ...  Internally, such sets are represented by logical formulas that define them, and an external satisfiability modulo theories (SMT) solver is regularly run by the interpreter to check their basic properties  ...  We are grateful to Eryk Kopczyński and Szymon Toruńczyk, who came up with the idea of using formulas to represent orbit-finite sets with atoms, and whose work on the LOIS library for C++ [10] has been  ... 
doi:10.4204/eptcs.207.3 fatcat:adqa23j4qbhnbbvhdfk4noskrm

A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness [chapter]

Ioannis T. Kassios, Eleftherios Kritikos
2013 Lecture Notes in Computer Science  
In the second part, we demonstrate the expressiveness of our methodology by verifying the implementation of concurrent copy-on-write lists (CCoWL).  ...  In the verification of programs that manipulate the heap, logics that emphasize localized reasoning, such as separation logic, are being used extensively.  ...  The authors are deeply grateful to P. Müller and to the three anonymous ESOP reviewers, whose deep and insightful comments significantly helped improve the quality of the paper.  ... 
doi:10.1007/978-3-642-37036-6_10 fatcat:rs37anqofbdkvmoduzsb62snwe

On decision-theoretic foundations for defaults

Ronen I. Brafman, Nir Friedman
2001 Artificial Intelligence  
Most of this effort concentrated on the question of entailment, i.e., what conclusions are warranted by a knowledge-base of defaults.  ...  We use probability and utility to measure the impact of possible states on the decision-making process.  ...  Joe Halpern, for comments on drafts of this paper and useful discussions relating to this work.  ... 
doi:10.1016/s0004-3702(01)00140-0 fatcat:kk6hlrvfjva7zjkulst6y77r3q

Coinductive Logic Programming [chapter]

Luke Simon, Ajay Mallya, Ajay Bansal, Gopal Gupta
2006 Lecture Notes in Computer Science  
We describe the implementation of coinductive logic programming found in Logtalk, discussing its features and limitations.  ...  As Logtalk uses as a back-end compiler a compatible Prolog system, we discuss the status of key Prolog features for an efficient and usable implementation of coinduction.  ...  We thank Gopal Gupta, Feliks Kluźniak, Neda Saeedloei, Brian DeVries, and Kyle Marple for helpful discussions on coinduction during a sabbatical visit to U.T.Dallas and for most of the coinduction examples  ... 
doi:10.1007/11799573_25 fatcat:y2kxgo26uvdzvpqp5w5kwyg7n4

Satisfiability Modulo Theories: An Appetizer [chapter]

Leonardo de Moura, Nikolaj Bjørner
2009 Lecture Notes in Computer Science  
It also draws on the most prolific problems in the past century of symbolic logic: the decision problem, completeness and incompleteness of logical theories, and finally complexity theory.  ...  Satisfiability Modulo Theories (SMT) is about checking the satisfiability of logical formulas over one or more theories.  ...  Some problems require or are more naturally described in more expressive logics such as first-order logic.  ... 
doi:10.1007/978-3-642-10452-7_3 fatcat:wabzhnbstbcgphtptloaywgfxy

Industrial applications of the PetriDotNet modelling and analysis tool

András Vörös, Dániel Darvas, Ákos Hajdu, Attila Klenik, Kristóf Marussy, Vince Molnár, Tamás Bartha, István Majzik
2018 Science of Computer Programming  
Next, we present eight different industrial case studies, demonstrating the wide variety of scenarios where Petri nets and PetriDotNet can help the design, development and analysis of industrial systems  ...  Since their invention, Petri nets have provided modelling and analysis methods to support the design of correct, reliable and robust systems.  ...  Supported by the ÚNKP-16-2-I. New National Excellence Program of the Ministry of Human Capacities.  ... 
doi:10.1016/j.scico.2017.09.003 fatcat:3ceytamrxjatbdkdqv4ea5niea

Exact Arithmetic of Zero and Infinity Based on the Conventional Division by Zero 0/0 = 1

Okoh Ufuoma
2019 Asian Research Journal of Mathematics  
The chief object of this work is to create an exact and consistent arithmetic of zero, denoted 0, and infinity (zero divisor), written as 1/0 and denoted ∞ , based on the conventional division by zero  ...  $$ \dfrac{{0}}{{0}}=1. $$ Manifold and undeniable applications of this arithmetic are given in this work in order to show its usefulness.  ...  Acknowledgement Thanks to Sciencedomain reviewers who helped so much in the improvement of this paper. Special thanks to Sciencedomain Editorial Team including Ms.  ... 
doi:10.9734/arjom/2019/v13i130099 fatcat:c2ark5r7kfbmhhnlv6sscpopgi

Harnessing Soft Logic to Represent the Privacy Paradox

Ron S. Hirschprung, Moshe Klein, Oded Maimon
2022 Informatics  
In this study we harness a new mathematical approach, "soft logic," to better represent the reality of the privacy paradox.  ...  While the existence and the extensive distribution of the privacy paradox is widely-considered in both academic and public discussion, no convincing explanation of the phenomenon has been provided.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/informatics9030054 fatcat:cckpizdbcnai7bz35qpodfekgy

On Variable Orderings in MCSAT for Non-linear Real Arithmetic : (extended abstract)

Jasper Nalbach, Gereon Lukas Kremer, Erika Ábrahám
2019 CEUR Workshop Proceedings  
Satisfiability-modulo-theories (SMT ) solving is a technique for checking the satisfiability of logical formulas.  ...  In classical lazy SMT solving, the search is decomposed in two interacting modules: at the Boolean level, truth values are searched for the theory constraints of an input formula such that the Boolean  ...  We only had a first glimpse of the possibilities that result from dynamic variable orderings.  ... 
doi:10.18154/rwth-conv-240068 fatcat:245p44r2vngf7j2w5puijg3tda

Automated deduction for verification

Natarajan Shankar
2009 ACM Computing Surveys  
The formal semantics defines the intended interpretation of the symbols and expressions used in these statements.  ...  The language captures the rules for forming statements and circumscribes the range of concepts that can be expressed.  ...  The article has been significantly improved by the detailed, authoritative, and deeply knowledgeable comments from the anonymous referees.  ... 
doi:10.1145/1592434.1592437 fatcat:satgicglyneqvl2nw5pjnr3d3a

What does a conditional knowledge base entail? [article]

Daniel Lehmann, Menachem Magidor
2002 arXiv   pre-print
This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation.  ...  The rational closure of a conditional knowledge base is defined and shown to provide an attractive answer to the question of the title.  ...  We shall, then, evaluate the value of rational closure as an answer to the question of the title.  ... 
arXiv:cs/0202022v1 fatcat:mff6v62ge5hb5ivl2l64i3b3gy

Constraint Satisfaction in Distributed Concurrent Logic Programming

1996 Journal of symbolic computation  
To support constraint solving in a committed-choice concurrent logic programming language, the constraint solver also needs to determine the status of the 'ask'-constraints with respect to the current  ...  Then we describe, in the framework of D/C-Parlog, algorithms for distributed constraint satisfaction problems in the domains of Real numbers and Boolean rings.  ...  The constraint is evaluated and simplified using the known variable values held in the logic programming machine before enqueuing.  ... 
doi:10.1006/jsco.1996.0037 fatcat:qfgi3p6clbbuvfqdquog3uncay
« Previous Showing results 1 — 15 out of 470 results