Filters








32,017 Hits in 4.6 sec

Metaphysics, Metamathematics and Metabiology [chapter]

Gregory Chaitin
2011 Randomness Through Computation  
In this essay we present an information-theoretic perspective on epistemology using software models.  ...  We shall use the notion of algorithmic information to discuss what is a physical law, to determine the limits of the axiomatic method, and to analyze Darwin's theory of evolution.  ...  Consider the following paradoxical program P : P runs through all possible proofs in the formal axiomatic theory A, searching for the first proof in A that an individual program Q is elegant for which  ... 
doi:10.1142/9789814327756_0006 fatcat:7rmz32xexbe5fc3qkjwr6dfpci

Research on Wind Power Equipment Selection System Based on Axiomatic and Knowledge

Chi ZONG
2018 DEStech Transactions on Engineering and Technology Research  
The reusability method for wind power equipment selection is researched, which realized the reuse of model, information, data and knowledge for wind power equipment selection process.  ...  Wind power equipment selection model based on knowledge is adopted and studied, the reuse of resource is actualized mostly by management of model information and knowledge.  ...  task, especially to the complex offshore wind power projects, AI technology would be an important development direction for renewable energy projects.  ... 
doi:10.12783/dtetr/ecar2018/26329 fatcat:67d3mpndbnhtnfwxnl4cnd4eiu

An Algorithm that Infers Theories from Facts

Ehud Y. Shapiro
1981 International Joint Conference on Artificial Intelligence  
A framework for inductive inference in logic is presented: a Model Inference Problem is defined, and it is shown that problems of machine learning and program synthesis from examples can be formulated  ...  The algorithm can be shown to identify in the limit [3] any model in a family of complexity classes of models, is most powerful of its kind, and is flexible enough to have been successfully implemented  ...  The Horn clauses in Figure 2 are an atomic-complete axiomatization of the model thus defined, and are also Prolog programs for computing append and reverae.  ... 
dblp:conf/ijcai/Shapiro81a fatcat:6dc4ene7trfnjbc4xeanxpw6em

An Axiomatic Memory Model for POWER Multiprocessors [chapter]

Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Kayvan Memarian, Jade Alglave, Scott Owens, Rajeev Alur, Milo M. K. Martin, Peter Sewell, Derek Williams
2012 Lecture Notes in Computer Science  
This complexity is particularly evident in the IBM R Power Architecture R , for which a faithful specification was published only in 2011 using an operational style.  ...  test programs, and we show that this tool is significantly more efficient than a tool based on an operational specification.  ...  the sets of behaviors allowed for any program are identical for both models: we show that any outcome allowed by the operational model is allowed in the axiomatic model and vice versa.  ... 
doi:10.1007/978-3-642-31424-7_36 fatcat:3mh6yutirze73pux7aqv2vh3a4

Axiomatic Basis for Computer Programming

Lauretta O. Osho, Francisca Ogwueleka, Oluwafemi Osho
2013 Universal Journal of Computational Mathematics  
Using the axiomatic basis the completeness of two variants of integer multiplication program is proved.  ...  This paper considers a formal method, known as axiomatic semantics, used to prove the correctness of a computer program.  ...  The word axiomatic connotes self-evidence, obviousness. An axiomatic method has the potency of providing basis for measuring the quality of a programming language [7] .  ... 
doi:10.13189/ujcmj.2013.010301 fatcat:qbka2vdgujedbd42obzu6hl3ku

Page 5254 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
“In Chapter 6 we look at an axiomatization for the empty process in discrete-time process algebra.  ...  An apparatus formalizing (top-down, bottom-up, or combined) design of programs is suggested that incorporates SAA-M, grammar and automaton models oriented towards multiprocessing.  ... 

Special Issue: Fixpoints in Computer Science 2000

2002 Journal of Logic and Computation  
Gurov We present a Gentzen-style sequent calculus for program verification which accommodates both model checkinglike verification based on global state space exploration, and compositional reasoning.  ...  Our axiomatization is heavily based on the one by Salomaa, that provided an implicative axiomatization for a large subset of regular expressions, namely all those that satisfy the non-empty word property  ...  Our axiomatization is heavily based on the one by Salomaa, that provided an implicative axiomatization for a large subset of regular expressions, namely all those that satisfy the non-empty word property  ... 
doi:10.1093/logcom/12.1.211 fatcat:yowegpu725gxpbpi7eabhc6caa

Page 5103 of Mathematical Reviews Vol. , Issue 911 [page]

1991 Mathematical Reviews  
Sci. 4 (1975), no. 2, 105-132] (pp. 217-243); 68 COMPUTER SCIENCE 911:68006 Parallel programming: an axiomatic approach [Comput.  ...  ACM 9 (1966), no. 6, 413- 432] (pp. 31-43); An axiomatic basis for computer programming [ibid. 12 (1969), no. 10, 576-580] (pp. 45-58); Proof of a pro- gram: Find [ibid. 14 (1971), no. 1, 39-45] (pp. 59  ... 

Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8

Christopher Pulte, Shaked Flur, Will Deacon, Jon French, Susmit Sarkar, Peter Sewell
2017 Proceedings of the ACM on Programming Languages  
We define two formal concurrency models: an operational one, simplifying the Flowing model of Flur et al., and the axiomatic model of the revised ARMv8 specification.  ...  Over time, and partly due to work building formal semantics for ARM concurrency, it has become clear that some of the complexity of the model is not justified by the potential benefits.  ...  Coherence EP/M027317/1 (Sarkar), an ARM iCASE award (Pulte), and an EPSRC IAA KTF (Flur).  ... 
doi:10.1145/3158107 dblp:journals/pacmpl/PulteFDFSS18 fatcat:r5kthtdprnck7ksin2z2ogmxdy

Page 5002 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
For these programs and sips, a procedure for computing well-founded models is presented that is applicable to the rewritten programs, thus allowing increased efficiency of specializing a program for a  ...  Summary “Virtually all semantic or object-oriented data models assume that objects have an identity separate from any of their parts and allow users to define complex object types in which part values  ... 

Axiomatic Design of Software Systems

Nam P. Suh, Sung-Hee Do
2000 CIRP annals  
This paper presents how the combination of axiomatic design has been combined with the object-oriented programming method to create a large software system.  ...  Software is playing an increasingly important role in manufacturing. Many manufacturing firms have problems with software development.  ...  A 'V model for software' shown in Fig. 1 will be used here to explain the concept of axiomatic design of object-oriented software systems (ADo-oSS).  ... 
doi:10.1016/s0007-8506(07)62904-7 fatcat:jn5msnunljge7mpbupok3humuu

Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models [chapter]

Jabob Burnim, Koushik Sen, Christos Stergiou
2011 Lecture Notes in Computer Science  
The monitoring algorithms arise naturally from the operational definitions of these relaxed memory models, highlighting an advantage of viewing relaxed memory models operationally rather than axiomatically  ...  We present a technique for verifying that a program has no executions violating sequential consistency (SC) when run under the relaxed memory models Total Store Order (TSO) and Partial Store Order (PSO  ...  Acknowledgments We would like to thank Krste Asanović, Pallavi Joshi, Chang-Seo Park, and our anonymous reviewers for their valuable comments.  ... 
doi:10.1007/978-3-642-19835-9_3 fatcat:5p4iurwxhfhtvionkccrroswhq

Agent-Oriented Software Engineering [chapter]

Nicholas R. Jennings
1999 Lecture Notes in Computer Science  
a genuine advance over the current state of the art for engineering complex systems.  ...  Agent-oriented techniques represent an exciting new means of analysing, designing and building complex software systems.  ...  For more complex agents, an axiomatization is not so straightforward.  ... 
doi:10.1007/3-540-48437-x_1 fatcat:e2lkvtkfkfcdva4rhlpztbbjvi

Agent-Oriented Software Engineering [chapter]

Stefan Bussmann, Paolo Ciancarini, Keith Decker, Michael Huhns, Michael Wooldridge
2000 Lecture Notes in Computer Science  
a genuine advance over the current state of the art for engineering complex systems.  ...  Agent-oriented techniques represent an exciting new means of analysing, designing and building complex software systems.  ...  For more complex agents, an axiomatization is not so straightforward.  ... 
doi:10.1007/10719619_18 fatcat:znz3r6xvfvhjvldg6qw63jbqbi

AGENT-ORIENTED SOFTWARE ENGINEERING [chapter]

MICHAEL WOOLDRIDGE, PAOLO CIANCARINI
2001 Handbook of Software Engineering and Knowledge Engineering  
a genuine advance over the current state of the art for engineering complex systems.  ...  Agent-oriented techniques represent an exciting new means of analysing, designing and building complex software systems.  ...  For more complex agents, an axiomatization is not so straightforward.  ... 
doi:10.1142/9789812389718_0021 fatcat:whdzpk2unvbwpmd47l4bgsaojm
« Previous Showing results 1 — 15 out of 32,017 results