SOA is built upon and evolving from older concepts of distributed computing and modular programming, OWL-S plays a key role in describing behaviors of web services, which are the essential of the SOA software. Althoug...SOA is built upon and evolving from older concepts of distributed computing and modular programming, OWL-S plays a key role in describing behaviors of web services, which are the essential of the SOA software. Although OWL-S has given semantics to concepts by ontology technology, it gives no semantics to control-flow and data-flow. This paper presents a formal semantics framework for OWL-S sub-set, including its abstraction, syntax, static and dynamic seman-tics by rewrite logic. Details of a consistent transformation from OWL-S SOS of control-flow to corresponding rules and equations, and dataflow semantics including “Precondition”, “Result” and “Binding” etc. are explained. This paper provides a possibility for formal verification and reliability evaluation of software based on SOA.展开更多
Nowadays researchers working in various fields study the issues of argument. They represent different approaches which distinguish with theoretical and practical comprehension of argument problems. Informal study of a...Nowadays researchers working in various fields study the issues of argument. They represent different approaches which distinguish with theoretical and practical comprehension of argument problems. Informal study of argument is one of the approaches. The key reason of its appearance was the criticism of formal logic in the late 20th century. Researchers consider the argument from the different point of view. Formal dialectics and pragma-dialectics were based on dialectics. Contemporary rhetorical theories of argument were created on the rhetorical grounds; theory of speech acts on the basis of practical philosophy etc.. This paper is devoted to some theoretical problems of informal logic which was formed on the logic background in the late 70＇s. In spite of numerous papers, books, and text-books on informal logic published over the last thirty years, logicians has not achieved consensus so far on many issues. Among the numerous problems are： what is the subject matter of informal logic？ Does informal logic belong to the realm of logic？ Is it applied epistemology？ What is a real argument？ And what are the criteria for evaluating of such arguments？展开更多
The article is devoted to hitherto never undertaken applying an almost unknown logically formalized axiomatic epistemology-and-axiology system called “Sigma-V” to the Third Newton’s Law of mechanics. The author has...The article is devoted to hitherto never undertaken applying an almost unknown logically formalized axiomatic epistemology-and-axiology system called “Sigma-V” to the Third Newton’s Law of mechanics. The author has continued investigating the extraordinary (paradigm-breaking) hypothesis of formal-axiological interpreting Newton’s mathematical principles of natural philosophy and, thus, has arrived to discrete mathematical modeling a system of formal axiology of nature by extracting and systematical studying its proper algebraic aspect. Along with the proper algebraic machinery, the axiomatic (hypothetic-deductive) method is exploited in this investigation systematically. The research results are the followings. 1) The Third Newton’s Law of mechanics has been modeled by a formal-axiological equation of two-valued algebraic system of metaphysics as formal axiology. (Precise defining the algebraic system is provided.) The formal-axiological equation has been established (and examined) in this algebraic system by accurate computing compositions of relevant evaluation-functions. Precise tabular definitions of the evaluation-functions are given. 2) The wonderful formula representing the Third Newton’s Law (in the relevant physical interpretation of the formal theory Sigma-V) has been derived logically in Sigma-V from the presumption of a-priori-ness of knowledge. A precise axiomatic definition of the nontrivial notion “a-priori-ness of knowledge” is given. The formal derivation is implemented in strict accordance with the rigor standard of D. Hilbert’s formalism;hence, checking the formal derivation submitted in this article is not a difficult task. With respect to proper theoretical physics, the formal inference is a nontrivial scientific novelty which has not been discussed and published elsewhere yet.展开更多
The strong completeness of medium logic system is discussed. The following results are proved： medium propositional logic system MP and its extension MP^＊ are strong complete; medium predicate logic system MF and it...The strong completeness of medium logic system is discussed. The following results are proved： medium propositional logic system MP and its extension MP^＊ are strong complete; medium predicate logic system MF and its extensions （MF^＊ and ME^＊ ） are not strong complete; and generally, ff a consistent formal system is not strong complete, then any consistent extensions of this forreal system are not strong complete either.展开更多
Can the semantics of a program be represented as a single formula? We show that one formula is insufficient to handle assertions, refinement or slicing, while two formulae are sufficient: A (S) , defining non-terminat...Can the semantics of a program be represented as a single formula? We show that one formula is insufficient to handle assertions, refinement or slicing, while two formulae are sufficient: A (S) , defining non-termination, and B (S), defining behaviour. Any two formulae A and B will define a corresponding program. Refinement is defined as implication between these formulae.展开更多
文摘SOA is built upon and evolving from older concepts of distributed computing and modular programming, OWL-S plays a key role in describing behaviors of web services, which are the essential of the SOA software. Although OWL-S has given semantics to concepts by ontology technology, it gives no semantics to control-flow and data-flow. This paper presents a formal semantics framework for OWL-S sub-set, including its abstraction, syntax, static and dynamic seman-tics by rewrite logic. Details of a consistent transformation from OWL-S SOS of control-flow to corresponding rules and equations, and dataflow semantics including “Precondition”, “Result” and “Binding” etc. are explained. This paper provides a possibility for formal verification and reliability evaluation of software based on SOA.
文摘Nowadays researchers working in various fields study the issues of argument. They represent different approaches which distinguish with theoretical and practical comprehension of argument problems. Informal study of argument is one of the approaches. The key reason of its appearance was the criticism of formal logic in the late 20th century. Researchers consider the argument from the different point of view. Formal dialectics and pragma-dialectics were based on dialectics. Contemporary rhetorical theories of argument were created on the rhetorical grounds; theory of speech acts on the basis of practical philosophy etc.. This paper is devoted to some theoretical problems of informal logic which was formed on the logic background in the late 70＇s. In spite of numerous papers, books, and text-books on informal logic published over the last thirty years, logicians has not achieved consensus so far on many issues. Among the numerous problems are： what is the subject matter of informal logic？ Does informal logic belong to the realm of logic？ Is it applied epistemology？ What is a real argument？ And what are the criteria for evaluating of such arguments？
文摘The article is devoted to hitherto never undertaken applying an almost unknown logically formalized axiomatic epistemology-and-axiology system called “Sigma-V” to the Third Newton’s Law of mechanics. The author has continued investigating the extraordinary (paradigm-breaking) hypothesis of formal-axiological interpreting Newton’s mathematical principles of natural philosophy and, thus, has arrived to discrete mathematical modeling a system of formal axiology of nature by extracting and systematical studying its proper algebraic aspect. Along with the proper algebraic machinery, the axiomatic (hypothetic-deductive) method is exploited in this investigation systematically. The research results are the followings. 1) The Third Newton’s Law of mechanics has been modeled by a formal-axiological equation of two-valued algebraic system of metaphysics as formal axiology. (Precise defining the algebraic system is provided.) The formal-axiological equation has been established (and examined) in this algebraic system by accurate computing compositions of relevant evaluation-functions. Precise tabular definitions of the evaluation-functions are given. 2) The wonderful formula representing the Third Newton’s Law (in the relevant physical interpretation of the formal theory Sigma-V) has been derived logically in Sigma-V from the presumption of a-priori-ness of knowledge. A precise axiomatic definition of the nontrivial notion “a-priori-ness of knowledge” is given. The formal derivation is implemented in strict accordance with the rigor standard of D. Hilbert’s formalism;hence, checking the formal derivation submitted in this article is not a difficult task. With respect to proper theoretical physics, the formal inference is a nontrivial scientific novelty which has not been discussed and published elsewhere yet.
文摘The strong completeness of medium logic system is discussed. The following results are proved： medium propositional logic system MP and its extension MP^＊ are strong complete; medium predicate logic system MF and its extensions （MF^＊ and ME^＊ ） are not strong complete; and generally, ff a consistent formal system is not strong complete, then any consistent extensions of this forreal system are not strong complete either.
文摘Can the semantics of a program be represented as a single formula? We show that one formula is insufficient to handle assertions, refinement or slicing, while two formulae are sufficient: A (S) , defining non-termination, and B (S), defining behaviour. Any two formulae A and B will define a corresponding program. Refinement is defined as implication between these formulae.
