Pondy, Dorothy, Comp.
The catalog was compiled to assist instructors in planning community college and university curricula using the 48 computer-assisted accountancy lessons available on PLATO IV (Programmed Logic for Automatic Teaching Operation) for first semester accounting courses. It contains information on lesson access, lists of acceptable abbreviations for…
Plato's Anti-Kohlbergian Program for Moral Education
Jonas, Mark E.
2016-01-01
Following Lawrence Kohlberg it has been commonplace to regard Plato's moral theory as "intellectualist", where Plato supposedly believes that becoming virtuous requires nothing other than "philosophical knowledge or intuition of the ideal form of the good". This is a radical misunderstanding of Plato's educational programme,…
Logic via Computer Programming.
Wieschenberg, Agnes A.
This paper proposed the question "How do we teach logical thinking and sophisticated mathematics to unsophisticated college students?" One answer among many is through the writing of computer programs. The writing of computer algorithms is mathematical problem solving and logic in disguise and it may attract students who would otherwise stop…
A Summary of Plato Curriculum and Research Materials.
Lyman, Elisabeth R.
PLATO (programmed Logic for Automatic Teaching Operations) is a computer-based teaching system which was developed in the Coordinated Science Laboratory at the University of Illinois to explore the possibilities of automation in individual instruction. The history of the PLATO program is summarized here, along with a list of courses which used…
Logic Programming for Linguistics
DEFF Research Database (Denmark)
Christiansen, Henning
2010-01-01
This article gives a short introduction on how to get started with logic pro- gramming in Prolog that does not require any previous programming expe- rience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what...... a computer is, can follow the text. I cannot, of course, cover all aspects of logic programming in this text, and so we give references to other sources with more details. Students of linguistics must have a very good motivation to spend time on programming, and I show here how logic programming can be used...... for modelling different linguistic phenomena. When modelling language in this way, as opposed to using only paper and pencil, your models go live: you can run and test your models and you can use them as automatic language analyzers. This way you will get a better understanding of the dynamics of languages...
Logic Programming for Linguistics
DEFF Research Database (Denmark)
Christiansen, Henning
2010-01-01
This article gives a short introduction on how to get started with logic pro- gramming in Prolog that does not require any previous programming expe- rience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what...
Embedding Description Logic Programs into Default Logic
Wang, Yisong; Yuan, Li Yan; Shen, Yi-Dong; Eiter, Thomas
2011-01-01
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter {\\em et al.} have been considered as a prominent formalism for integrating rules and ontology knowledge bases. A question of interest has been whether dl-programs can be captured in a general formalism of nonmonotonic logic. In this paper, we study the possibility of embedding dl-programs into default logic. We show that dl-programs under the strong and weak answer set semantics can be embedded in default logic by combining two translations, one of which eliminates the constraint operator from nonmonotonic dl-atoms and the other translates a dl-program into a default theory. For dl-programs without nonmonotonic dl-atoms but with the negation-as-failure operator, our embedding is polynomial, faithful, and modular. In addition, our default logic encoding can be extended in a simple way to capture recently proposed weakly well-supported answer set semantics, for arbitrary dl-programs. These results reinforce the argument ...
Quantum probabilistic logic programming
Balu, Radhakrishnan
2015-05-01
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
Freud, Plato and Irigaray: A Morpho-Logic of Teaching and Learning
Peers, Chris
2012-01-01
This article discusses two well-known texts that respectively describe learning and teaching, drawn from the work of Freud and Plato. These texts are considered in psychoanalytic terms using a methodology drawn from the philosophy of Luce Irigaray. In particular the article addresses Irigaray's approach to the analysis of speech and utterance as a…
Freud, Plato and Irigaray: A Morpho-Logic of Teaching and Learning
Peers, Chris
2012-01-01
This article discusses two well-known texts that respectively describe learning and teaching, drawn from the work of Freud and Plato. These texts are considered in psychoanalytic terms using a methodology drawn from the philosophy of Luce Irigaray. In particular the article addresses Irigaray's approach to the analysis of speech and utterance as a…
From logic design to logic programming
Energy Technology Data Exchange (ETDEWEB)
Snyers, D.; Thayse, A.
1987-01-01
The main purpose of the present book is to show that in the same way as P-functions can lead to algorithmic or imperative implementations via the algorithmic state machine model or via the parallel program schema, they can also lead to a declarative type of implementation via the theorem proving model. As P-functions are used for synthesizing algorithms, the result of the synthesis can be interpreted in terms of implementation tools. To the hardware, microprogrammed and programmed (in an algorithmic or imperative programming environment using fortran-like or pascal-like languages) implementations the authors can thus add logic programmed implementation as a possible result of the P-function calculus.
Program Theory Evaluation: Logic Analysis
Brousselle, Astrid; Champagne, Francois
2011-01-01
Program theory evaluation, which has grown in use over the past 10 years, assesses whether a program is designed in such a way that it can achieve its intended outcomes. This article describes a particular type of program theory evaluation--logic analysis--that allows us to test the plausibility of a program's theory using scientific knowledge.…
Probabilistic Logic Programming under Answer Sets Semantics
Institute of Scientific and Technical Information of China (English)
王洁; 鞠实儿
2003-01-01
Although traditional logic programming languages provide powerful tools for knowledge representation, they cannot deal with uncertainty information (e. g. probabilistic information). In this paper, we propose a probabilistic logic programming language by introduce probability into a general logic programming language. The work combines 4-valued logic with probability. Conditional probability can be easily represented in a probabilistic logic program. The semantics of such a probabilistic logic program i...
Characterising equilibrium logic and nested logic programs: Reductions and complexity
Pearce, David; Woltran, Stefan
2009-01-01
Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kinds of theories. In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs into quantified propositional logic, an extension of classical propositional logic where quantifications over atomic formulas are permitted. We provide reductions not only for decision problems, but also for the central semantical concepts of equilibrium logic and nested logic programs. In particular, our encodings map a given decision problem into some formula such that the latter is valid precisely in case the former holds. The basic tasks we deal with here are the consistency problem, brave reasoning, and skeptical reasoning. Additionally, we also provide encoding...
Symmetric Structure in Logic Programming
Institute of Scientific and Technical Information of China (English)
Jin-Zhao Wu; Harald Fecher
2004-01-01
It is argued that some symmetric structure in logic programs could be taken into account when implementing semantics in logic programming. This may enhance the declarative ability or expressive power of the semantics. The work presented here may be seen as representative examples along this line. The focus is on the derivation of negative information and some other classic semantic issues. We first define a permutation group associated with a given logic program. Since usually the canonical models used to reflect the common sense or intended meaning are minimal or completed models of the program, we expose the relationships between minimal models and completed models of the original program and its so-called G-reduced form newly-derived via the permutation group defined. By means of this G-reduced form, we introduce a rule to assume negative information termed G-CWA, which is actually a generalization of the GCWA. We also develop the notions of G-definite, G-hierarchical and G-stratified logic programs, which are more general than definite, hierarchical and stratified programs, and extend some well-known declarative and procedural semantics to them, respectively.
Mackenzie, Jim
2014-01-01
There is more to be said about two of the topics Chris Peers addresses in his article "Freud, Plato and Irigaray: A morpho-logic of teaching and learning" (2012, Educational Philosophy and Theory, 44, 760-774), namely the Socratic method of teaching and Plato's stance with regard to women and feminism. My purpose in this article is…
Mackenzie, Jim
2014-01-01
There is more to be said about two of the topics Chris Peers addresses in his article "Freud, Plato and Irigaray: A morpho-logic of teaching and learning" (2012, Educational Philosophy and Theory, 44, 760-774), namely the Socratic method of teaching and Plato's stance with regard to women and feminism. My purpose in this article is…
Logic programming with social features
Buccafurri, Francesco
2008-01-01
In everyday life it happens that a person has to reason about what other people think and how they behave, in order to achieve his goals. In other words, an individual may be required to adapt his behaviour by reasoning about the others' mental state. In this paper we focus on a knowledge representation language derived from logic programming which both supports the representation of mental states of individual communities and provides each with the capability of reasoning about others' mental states and acting accordingly. The proposed semantics is shown to be translatable into stable model semantics of logic programs with aggregates.
Logic Programming and Knowledge Maintenance.
1987-08-13
the literature , and became convinced that many of the advantages of frames and semantic nets can be captured in logic programming systems by a...consists of: needs(john,money). married_to(john,mary). loves(john,mary). (mary is the dead victim in this thriller .) The victim’s sister sara consists of
Program Logics for Homogeneous Meta-programming
Berger, Martin; Tratt, Laurence
A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Meta-programming has been used extensively since macros were introduced to Lisp, yet we have little idea how formally to reason about meta-programs. This paper provides the first program logics for homogeneous meta-programming - using a variant of MiniML_e^{square} by Davies and Pfenning as underlying meta-programming language. We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics.
Disjunctive logic and semantics of disjunctive logic programs
Institute of Scientific and Technical Information of China (English)
沈一栋
1997-01-01
In common sense reasoning with incomplete knowledge bases, conclusions are made by defaultHowever, it is observed that when the negation-by-default operator not is defined as not provable , the disjunctive logic program { a V b, not a, not b} should be consistent because a being not provable and b being nor provable does not imply a V b being riot provable. Such an observation is significant for non-monotonic reasoning, but none of the major current semantics for disjunctive logic programs is able to support it because they are all based on classical first-order logic in which assuming not a and not b implies assuming no: (a V b) A new first-order logic (disjunctive logic ) is developed that fully complies with this observation and new semantics for disjunctive logic programs are established This theory is able to formalize and solve some paradoxical problems, such as the lottery paradox
Control Data's Education Offering: "Plato Would Have Enjoyed PLATO"
Datamation, 1976
1976-01-01
Programmed Learning and Teaching Operation (PLATO) distributes instructional materials in the form of text, numbers, animated drawings and other graphics for individualized, self-paced learning. (Author)
Wilberding, James
2015-01-01
Embryology was a subject that inspired great cross-disciplinary discussion in antiquity, and Plato's Timaeus made an important contribution to this discussion, though Plato's precise views have remained a matter of controversy, especially regarding three key questions pertaining to the generation and nature of the seed: whether there is a female seed; what the nature of seed is; and whether the seed contains a preformed human being. In this paper I argue that Plato's positions on these three issues can be adequately determined, even if some other aspects of his theory cannot. In particular, it is argued that (i) Plato subscribes to the encephalo-myelogenic theory of seed, though he places particular emphasis on the soul being the true seed; (ii) Plato is a two-seed theorist, yet the female seed appears to make no contribution to reproduction; and (iii) Plato cannot be an advocate of preformationism.
Programming Games for Logical Thinking
Directory of Open Access Journals (Sweden)
H. Tsalapatas
2013-03-01
Full Text Available Analytical thinking is a transversal skill that helps learners synthesize knowledge across subject areas; from mathematics, science, and technology to critical reading, critical examination, and evaluation of lessons. While most would not doubt the importance of analytical capacity in academic settings and its growing demand for the skill in professional environments, school curricula do not comprehensively address its development. As a result, the responsibility for structuring related learning activities falls to teachers. This work examines learning paradigms that can be integrated into mathematics and science school education for developing logical thinking through game-based exercises based on programming. The proposed learning design promotes structured algorithmic mindsets, is based on inclusive universal logic present in all cultures, and promotes constructivism educational approaches encouraging learners to drive knowledge building by composing past and emerging experiences.
Set Constraints and Logic Programming (Preprint)
2016-02-24
Assoc Comput Sci Logic Springer September A Aiken D Kozen and E Wimmers Decidability of systems of set constraints with negative...Extensions of Logic Programming ELP volume of Lect Notes Articial Intell pages Springer February J Englefriet Tree... Springer September D Kozen Set constraints and logic programming abstract In JP Jouannaud editor Proc First Conf Constraints in
A History of Probabilistic Inductive Logic Programming
Directory of Open Access Journals (Sweden)
Fabrizio eRiguzzi
2014-09-01
Full Text Available The field of Probabilistic Logic Programming (PLP has seen significant advances in the last 20 years, with many proposals for languages that combine probability with logic programming. Since the start, the problem of learning probabilistic logic programs has been the focus of much attention. Learning these programs represents a whole subfield of Inductive Logic Programming (ILP. In Probabilistic ILP (PILP two problems are considered: learning the parameters of a program given the structure (the rules and learning both the structure and the parameters. Usually structure learning systems use parameter learning as a subroutine. In this article we present an overview of PILP and discuss the main results.
A Framed Temporal Logic Programming Language
Institute of Scientific and Technical Information of China (English)
Zhen-Hua Duan; Maciej Koutny
2004-01-01
We discuss the projection temporal logic (PTL), based on a primitive projection operator, prj. A framing technique is also presented, using which a synchronization operator, await, is defined within the underlying logic. A framed temporal logic programming language (FTLL) is presented. To illustrate how to use both the language and framing technique, some examples are given.
A Denotational Semantics for Logic Programming
DEFF Research Database (Denmark)
Frandsen, Gudmund Skovbjerg
A fully abstract denotational semantics for logic programming has not been constructed yet. In this paper we present a denotational semantics that is almost fully abstract. We take the meaning of a logic program to be an element in a Plotkin power domain of substitutions. In this way our result...... shows that standard domain constructions suffice, when giving a semantics for logic programming. Using the well-known fixpoint semantics of logic programming we have to consider two different fixpoints in order to obtain information about both successful and failed computations. In contrast, our...... semantics is uniform in that the (single) meaning of a logic program contains information about both successful, failed and infinite computations. Finally, based on the full abstractness result, we argue that the detail level of substitutions is needed in any denotational semantics for logic programming....
Extensionality of simply typed logic programs
M.A. Bezem
1999-01-01
textabstractWe set up a framework for the study of extensionality in the context of higher-order logic programming. For simply typed logic programs we propose a novel declarative semantics, consisting of a model class with a semi-computable initial model, and a notion of extensionality. We show that
Discovering Classes of Strongly Equivalent Logic Programs
Chen, Y.; Lin, F.
2011-01-01
In this paper we apply computer-aided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules that preserve strong equivalence. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a rule and the empty set, between two rules, between t...
Proof theory of epistemic logic of programs
Maffezioli, Paolo; Naibo, Alberto
2014-01-01
A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system
Mathematical aspects of logic programming semantics
Hitzler, Pascal
2010-01-01
Covering the authors' own state-of-the-art research results, Mathematical Aspects of Logic Programming Semantics presents a rigorous, modern account of the mathematical methods and tools required for the semantic analysis of logic programs. It significantly extends the tools and methods from traditional order theory to include nonconventional methods from mathematical analysis that depend on topology, domain theory, generalized distance functions, and associated fixed-point theory.The book covers topics spanning the period from the early days of logic programming to current times. It discusses
What is Plato? Inference and Allusion in Plato's "Sophist."
Quandahl, Ellen
1989-01-01
Discusses inference and allusion in the dialogue in Plato's Sophist. Examines the sense in which a locution is used, distinguishing among senses of the verb to be, and sets the ball rolling for the development of logic and the whole metaphysics of categories of being. (RAE)
Mathematical Programming and Logical Inference
1990-12-01
solution of inference problems in propositional logic, to appear in Annals of Mathematics and Al. (271 Howard, R. A., and J. E. Matheson, Influence...1981). (281 Jeroslow, R., and J. Wang, Solving propositional satisfiability problems, to appear in Annals of Mathematics and Al. [29] Nilsson, N. J
Conceptual Modeling via Logic Programming
1990-01-01
interfaces. nism which does not depend on Unix file The object-oriented nature of ProWIN- descriptors. One of the significant problems DOWS (which...Sweet, to CLOS. Reading, Mass.: Addison-Wesley, "Evaluating Alternative Air Defense 1988. Architectures," Signal, January 1987. Kernighan , B., and D...and sity of Waterloo, 1977. Sons, 1988. Robinson, J., "A Machine-Oriented Logic Unix Interface Overview. Mountain View, Based on the Resolution
On the Relationship Between TMS and Logic Programs
Institute of Scientific and Technical Information of China (English)
王献昌; 赵沁平; 等
1994-01-01
The relationship between TMS and general logic programs is an important issue in non-monotonic logic programming.In this paper,we prove that,after we translate the TMS theory into a general logic program,the TMS's well-founded assignment (or extension) is equivalent to the corresponding general logic program's stable model.It means that TMS can be completely integrated into a non-monotonic logic programming environment.
A Logic-Program-Based Negotiation Mechanism
Institute of Scientific and Technical Information of China (English)
Wu Chen; Ming-Yi Zhang; Mao-Nian Wu
2009-01-01
This paper presents a logic-program-based mechanism of negotiation between two agents. In this mechanism an extended logic program (ELP) is regarded as an agent. The negotiation process between two agents is then modelled as multiple encounters between two ELPs, each of which selects an answer set as its initial demand. Both agents mutually revise the original sets of demands through accepting part of the opponent's demand and/or giving up part of its own demand. The overall dynamics can be regarded as mutual updates between two extended logic programs. A deal to achieve an appropriate negotiation solution is put forward. The conditions of existence and terminability of an appropriate negotiation are given. Properties of a negotiation solution are discussed, including its weak Pareto optimality.
Logic integer programming models for signaling networks.
Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert
2009-05-01
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.
Model Checking with Probabilistic Tabled Logic Programming
Gorlin, Andrey; Smolka, Scott A
2012-01-01
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for queries with a finite number of explanations. This restriction prohibits the encoding of probabilistic model checkers, where explanations correspond to executions of the system being model checked. To overcome this restriction, we propose a more general inference algorithm that uses finite generative structures (similar to automata) to represent families of explanations. The inference algorithm computes the probability of a possibly infinite set of explanations directly from the finite generative structure. We have implemented our inference algorithm in XSB Prolog, and use this implementation to encode probabilistic model...
Agent-Oriented Probabilistic Logic Programming
Institute of Scientific and Technical Information of China (English)
Jie Wang; Shi-Er Ju; Chun-Nian Liu
2006-01-01
Currently, agent-based computing is an active research area, and great efforts have been made towards the agent-oriented programming both from a theoretical and practical view. However, most of them assume that there is no uncertainty in agents' mental state and their environment. In other words, under this assumption agent developers are just allowed to specify how his agent acts when the agent is 100% sure about what is true/false. In this paper, this unrealistic assumption is removed and a new agent-oriented probabilistic logic programming language is proposed, which can deal with uncertain information about the world. The programming language is based on a combination of features of probabilistic logic programming and imperative programming.
Permission-Based Separation Logic for Multithreaded Java Programs
Haack, Christian; Huisman, Marieke; Hurlin, C.
2011-01-01
This paper motivates and presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent separation logic to a multithreaded Java-like language. The program logic associates a unique static access permission with each heap location, ensuring exclusive write accesses and ruli...
Permission-Based Separation Logic for Multithreaded Java Programs.
Amighi, Afshin; Haack, Christian; Huisman, Marieke; Hurlin, Clément
2011-01-01
This paper presents a program logic for reasoning about multithreaded Java-like programs with dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent separation logic to a multithreaded Java-like language. The program logic associates a unique static access permission with each heap location, ensuring exclusive write accesses and ruling out data races. Concurrent reads are suppo...
Declarative Semantics of Input Consuming Logic Programs
Bossi, Annalisa; Cocco, Nicoletta; Etalle, Sandro; Rossi, Sabina; Bruynooghe, Maurice; Lau, Kung-Kia
2004-01-01
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to describe dynamic scheduling while abstracting from the technical details. We review and compare the differe
Declarative Semantics of Input Consuming Logic Programs
Bossi, Annalisa; Cocco, Nicoletta; Etalle, Sandro; Rossi, Sabina; Bruynooghe, Maurice; Lau, Kung-Kia
2004-01-01
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to describe dynamic scheduling while abstracting from the technical details. We review and compare the differe
Mixed wasted integrated program: Logic diagram
Energy Technology Data Exchange (ETDEWEB)
Mayberry, J.; Stelle, S. [Science Applications International Corp., Idaho Falls, ID (United States); O`Brien, M. [Univ. of Arizona, Tucson, AZ (United States); Rudin, M. [Univ. of Nevada, Las Vegas, NV (United States); Ferguson, J. [Lockheed Idaho Technologies Co., Idaho Falls, ID (United States); McFee, J. [I.T. Corp., Albuquerque, NM (United States)
1994-11-30
The Mixed Waste Integrated Program Logic Diagram was developed to provide technical alternative for mixed wastes projects for the Office of Technology Development`s Mixed Waste Integrated Program (MWIP). Technical solutions in the areas of characterization, treatment, and disposal were matched to a select number of US Department of Energy (DOE) treatability groups represented by waste streams found in the Mixed Waste Inventory Report (MWIR).
Logic programming and logarithmic space
DEFF Research Database (Denmark)
Aubert, CléMent; Bagnol, Marc; Pistone, Paolo;
2014-01-01
We show that the acceptance of a word by an observation (the counterpart of a program in the encoding) can be decided within logarithmic space, by reducing this problem to the acyclicity of a graph. We show moreover that observations are as expressive as two-ways multihead finite automata, a kind...
Molecular implementation of simple logic programs
Ran, Tom; Kaplan, Shai; Shapiro, Ehud
2009-11-01
Autonomous programmable computing devices made of biomolecules could interact with a biological environment and be used in future biological and medical applications. Biomolecular implementations of finite automata and logic gates have already been developed. Here, we report an autonomous programmable molecular system based on the manipulation of DNA strands that is capable of performing simple logical deductions. Using molecular representations of facts such as Man(Socrates) and rules such as Mortal(X) system can answer molecular queries such as Mortal(Socrates)? (Is Socrates Mortal?) and Mortal(X)? (Who is Mortal?). This biomolecular computing system compares favourably with previous approaches in terms of expressive power, performance and precision. A compiler translates facts, rules and queries into their molecular representations and subsequently operates a robotic system that assembles the logical deductions and delivers the result. This prototype is the first simple programming language with a molecular-scale implementation.
Functional Logic Programming with Generalized Circular Coinduction
de Haan, Ronald
2012-01-01
We propose a method to adapt functional logic programming to deal with reasoning on coinductively interpreted programs as well as on inductively interpreted programs. In order to do so, we consider a class of objects interesting for this coinductive interpretation, namely regular terms. We show how the usual data structures can be adapted to capture these objects. We adapt the operational semantics of Curry to interpret programs coinductively. We illustrate this method with several examples that show the working of our method and several cases in which it could be useful. Finally, we suggest how the declarative semantics can be adapted suitably.
ALPES: an advanced logic programming environment
Directory of Open Access Journals (Sweden)
Cristina Ruggieri
1988-11-01
Full Text Available This paper introduces a software programming environment for an extended Prolog language, called ALPES. The purpose of ALPES is to enable a logic programming paradigm to become a software engineering tool to design, develop and prototype traditional software systems, as well as artificial intelligence applications. The key structuring concepts for programs, as well as for the system architecture as a whole are those of contexts, processes and communication. The software design and development methodologies induced by the use of the Alpes-Prolog language have been incrementally used to develop the environment itself. This research was conducted under the Esprit projects P973 (ALPES.
FC-normal and extended stratified logic program
Institute of Scientific and Technical Information of China (English)
许道云; 丁德成
2002-01-01
This paper investigates the consistency property of FC-normal logic program and presentsan equivalent deciding condition whether a logic program P is an FC-normal program. The decidingcondition describes the characterizations of FC-normal program. By the Petri-net presentation ofa logic program, the characterizations of stratification of FC-normal program are investigated. Thestratification of FC-normal program motivates us to introduce a new kind of stratification, extendedstratification, over logic program. It is shown that an extended (locally) stratified logic program isan FC-normal program. Thus, an extended (locally) stratified logic program has at least one stablemodel. Finally, we have presented algorithms about computation of consistency property and a fewequivalent deciding methods of the finite FC-normal program.
Abstract Interpretation of PIC programs through Logic Programming
DEFF Research Database (Denmark)
Henriksen, Kim Steen; Gallagher, John Patrick
2006-01-01
, are applied to the logic based model of the machine. A small PIC microcontroller is used as a case study. An emulator for this microcontroller is written in Prolog, and standard programming transformations and analysis techniques are used to specialise this emulator with respect to a given PIC program....... The specialised emulator can now be further analysed to gain insight into the given program for the PIC microcontroller. The method describes a general framework for applying abstractions, illustrated here by linear constraints and convex hull analysis, to logic programs. Using these techniques on the specialised...
Efficient Tabling Mechanisms for Transaction Logic Programs
Fodor, Paul
2007-01-01
In this paper we present efficient evaluation algorithms for the Horn Transaction Logic (a generalization of the regular Horn logic programs with state updates). We present two complementary methods for optimizing the implementation of Transaction Logic. The first method is based on tabling and we modified the proof theory to table calls and answers on states (practically, equivalent to dynamic programming). The call-answer table is indexed on the call and a signature of the state in which the call was made. The answer columns contain the answer unification and a signature of the state after the call was executed. The states are signed efficiently using a technique based on tries and counting. The second method is based on incremental evaluation and it applies when the data oracle contains derived relations. The deletions and insertions (executed in the transaction oracle) change the state of the database. Using the heuristic of inertia (only a part of the state changes in response to elementary updates), mos...
DNA strand displacement system running logic programs.
Rodríguez-Patón, Alfonso; Sainz de Murieta, Iñaki; Sosík, Petr
2014-01-01
The paper presents a DNA-based computing model which is enzyme-free and autonomous, not requiring a human intervention during the computation. The model is able to perform iterated resolution steps with logical formulae in conjunctive normal form. The implementation is based on the technique of DNA strand displacement, with each clause encoded in a separate DNA molecule. Propositions are encoded assigning a strand to each proposition p, and its complementary strand to the proposition ¬p; clauses are encoded comprising different propositions in the same strand. The model allows to run logic programs composed of Horn clauses by cascading resolution steps. The potential of the model is demonstrated also by its theoretical capability of solving SAT. The resulting SAT algorithm has a linear time complexity in the number of resolution steps, whereas its spatial complexity is exponential in the number of variables of the formula. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.
Permission-Based Separation Logic for Multithreaded Java Programs
Haack, Christian; Huisman, Marieke; Hurlin, C.
2011-01-01
This paper motivates and presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of
A Program Transformation for Backwards Analysis of Logic Programs
DEFF Research Database (Denmark)
Gallagher, John Patrick
2003-01-01
The input to backwards analysis is a program together with properties that are required to hold at given program points. The purpose of the analysis is to derive initial goals or pre-conditions that guarantee that, when the program is executed, the given properties hold. The solution for logic...... programs presented here is based on a transformation of the input program, which makes explicit the dependencies of the given program points on the initial goals. The transformation is derived from the resultants semantics of logic programs. The transformed program is then analysed using a standard...... abstract interpretation. The required pre-conditions on initial goals can be deduced from the analysis results without a further fixpoint computation. For the modes backwards analysis problem, this approach gives the same results as previous work, but requires only a standard abstract interpretation...
The Family of Concurrent Logic Programming Languages
1989-05-01
193]. - 85 - 19.3 Proces to proceso mapping The question of how to map processes to processors is not unique to concurrent logic programming, and any...procinors(N,ToQ) queue(ToQ), -8 7 - procemorie(N,ToQ)Qnext. processors’(0,_). procesos (N,ToQ) - N>O I N’:=N-1, procesior(ToQ), processor’(N’ ,ToQ)Onext...of Computing, Imperial College, London, 1988. [35] Davison, A., POOL: A PARLOG object oriented language, Department of Computing, Im- penal College
Extended Fuzzy Logic Programs with Fuzzy Answer Set Semantics
Saad, Emad
This paper extends fuzzy logic programs [12, 24] to allow the explicit representation of classical negation as well as non-monotonic negation, by introducing the notion of extended fuzzy logic programs. We present the fuzzy answer set semantics for the extended fuzzy logic programs, which is based on the classical answer set semantics of classical extended logic programs [7]. We show that the proposed semantics is a natural extension to the classical answer set semantics of classical extended logic programs [7]. Furthermore, we define fixpoint semantics for extended fuzzy logic programs with and without non-monotonic negation, and study their relationship to the fuzzy answer set semantics. In addition, we show that the fuzzy answer set semantics is reduced to the stable fuzzy model semantics for normal fuzzy logic programs introduced in [42]. The importance of that is computational methods developed for normal fuzzy logic programs can be applied to the extended fuzzy logic programs. Moreover, we show that extended fuzzy logic programs can be intuitively used for representing and reasoning about actions in fuzzy environment.
Resource-oriented Programming Based on Linear Logic
Directory of Open Access Journals (Sweden)
Valerie Novitzká
2007-08-01
Full Text Available In our research we consider programming as logical reasoning over types.Linear logic with its resource-oriented features yields a proper means for our approachbecause it enables to consider about resources as in real life: after their use they areexhausted. Computation then can be regarded as proof search. In our paper we presenthow space and time can be introduced into this logic and we discuss several programminglanguages based on linear logic.
Complexities of Homomorphism and Isomorphism for Definite Logic Programs
Institute of Scientific and Technical Information of China (English)
Dao-Yun Xu; Zhi-Hong Tao
2005-01-01
A homomorphism ψ of logic programs from P to P' is a function mapping Atoms(P) to Atoms(P') and paper, the complexity of the decision problems on homomorphism and isomorphism for definite logic programs is studied.It is shown that the homomorphism problem (HOM-LP) for definite logic programs is NP-complete, and the isomorphism problem (ISO-LP) is equivalent to the graph isomorphism problem (GI).
ALPprolog --- A New Logic Programming Method for Dynamic Domains
Drescher, Conrad
2011-01-01
Logic programming is a powerful paradigm for programming autonomous agents in dynamic domains, as witnessed by languages such as Golog and Flux. In this work we present ALPprolog, an expressive, yet efficient, logic programming language for the online control of agents that have to reason about incomplete information and sensing actions.
A Sound and Complete Program Logic for Eiffel
Nordio, Martin; Calcagno, Cristiano; Müller, Peter; Meyer, Bertrand
Object-oriented languages provide advantages such as reuse and modularity, but they also raise new challenges for program verification. Program logics have been developed for languages such as C# and Java. However, these logics do not cover the specifics of the Eiffel language. This paper presents a program logic for Eiffel that handles exceptions, once routines, and multiple inheritance. The logic is proven sound and complete w.r.t. an operational semantics. Lessons on language design learned from the experience are discussed.
The Haskell Road to Logic, Maths and Programming, Second Edition
Doets, H.C.; Eijck, D.J.N. van
2012-01-01
The purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. The programming language that will be our tool for this is Haskell, a member of the Lisp family. Haskell emerged in the last decade as a standard for lazy fu
The Haskell Road to Logic, Maths and Programming, Second Edition
H.C. Doets; D.J.N. van Eijck (Jan)
2012-01-01
textabstractThe purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. The programming language that will be our tool for this is Haskell, a member of the Lisp family. Haskell emerged in the last decade as a
Probabilistic Logic Programming%概率逻辑程序
Institute of Scientific and Technical Information of China (English)
王洁; 鞠实儿
2003-01-01
The purpose of this paper is to present the syntax and semantics of probabilistic logic programming to al-low for the correct representation of incomplete information. General logic programming is extended by a subintervalof [0,1] that describes the range for the conditional probability of the head of a clause given the range for the proba-bility of each atom of its body. We define the semantics (answer sets semantics) of such probabilistic logic program-ming and illustrative their applications. We also show some properties of answer sets semantics for the probabilisticlogic programs.
Consistency-based abduction with extended disjunctive logic programs
Institute of Scientific and Technical Information of China (English)
王克文; 陈火旺; 吴泉源
1997-01-01
By translating each disjunctive logic program into an abductive framework, a declarative semantics for the class of disjunctive logic programs, called the typical abductive semantics (TAS), is presented, which is quite simple and highly intuitive. TAS is complete and coincides with the stable semantics for the class of disjunctive programs that possess stable models. By the coherence principle, TAS can be easily generalized to extended disjunctive programs and can properly handle some benchmark problems in commonsense reasoning
Testing Automation of Context-Oriented Programs Using Separation Logic
Directory of Open Access Journals (Sweden)
Mohamed A. El-Zawawy
2014-01-01
Full Text Available A new approach for programming that enables switching among contexts of commands during program execution is context-oriented programming (COP. This technique is more structured and modular than object-oriented and aspect-oriented programming and hence more flexible. For context-oriented programming, as implemented in COP languages such as ContextJ* and ContextL, this paper introduces accurate operational semantics. The language model of this paper uses Java concepts and is equipped with layer techniques for activation/deactivation of layer contexts. This paper also presents a logical system for COP programs. This logic is necessary for the automation of testing, developing, and validating of partial correctness specifications for COP programs and is an extension of separation logic. A mathematical soundness proof for the logical system against the proposed operational semantics is presented in the paper.
Filsafat Ketuhanan Menurut Plato
Directory of Open Access Journals (Sweden)
Ivan Th.J Weismann
2005-06-01
Full Text Available Plato adalah filsuf pertama yang menulis secara filosofis dan secara sistematik teologis mengenai konsep Ketuhanan sehingga dapatlah dikatakan bahwa ia adalah peletqk dasar bagi ilmu teologia dan memberikan pengaruh besar bagi perkembanganfilsafat Barat khususnya tentangkonsep Ketuhanan. Pemikiran Plato tentang Ketuhanan adalah upayanya untuk mereformasi konsep Ketuhanan yang terdapat pada masyarakat Yunani kuno. Tulisan ini berupaya menganalisis dan memahami Ketuhanan menurut Plato agar pembaca masa kini dapat mengerti lebih dalam lagi tentong konsep Ketuhanan yang dipahami masyarakat Yunani kuno dan khususnya menurut Plato, dan juga dapat dijadikan sebagai bahan perbandingan bagifilsafat Ketuhanan pada masa kini. Filsafat Ketuhanan menurut Plato ini penulis jelaskan dengan memperhatikandimensi metafisika, epistemologi, dan etika.
Consistency Property of Finite FC-Normal Logic Programs
Institute of Scientific and Technical Information of China (English)
Yi-Song Wang; Ming-Yi Zhang; Yu-Ping Shen
2007-01-01
Marek's forward-chaining construction is one of the important techniques for investigating the non-monotonic reasoning. By introduction of consistency property over a logic program, they proposed a class of logic programs, FC-normal programs, each of which has at least one stable model. However, it is not clear how to choose one appropriate consistency property for deciding whether or not a logic program is FC-normal. In this paper, we firstly discover that, for any finite logic program ∏, there exists the least consistency property LCon(∏) over ∏, which just depends on ∏ itself, such that, ∏ is FC-normal if and only if ∏ is FC-normal with respect to (w.r.t.) LCon(∏). Actually, in order to determine the FC-normality of a logic program, it is sufficient to check the monotonic closed sets in LCon(∏) for all non-monotonic rules, that is LFC(∏). Secondly, we present an algorithm for computing LFC(∏). Finally, we reveal that the brave reasoning task and cautious reasoning task for FC-normal logic programs are of the same difficulty as that of normal logic programs.
Inductive Logic Programming for Industrial Control Applications
Directory of Open Access Journals (Sweden)
Samiya Bouarroudj
2014-04-01
Full Text Available Advanced Monitoring Systems of the processes consti tute a higher level to the systems of control and use specific techniques and methods. An importa nt part of the task of supervision focuses on the detection and the diagnosis of various situatio ns of faults which can affect the process. Methods of fault detection and diagnosis (FDD are different from the type of knowledge about the process that they require. They can be classifi ed as data-driven, analytical, or knowledge- based approach. A collaborative FDD approach that c ombines the strengths of various heterogeneous FDD methods is able to maximize diagn ostic performance. The new generation of knowledge-based systems or decision support syst ems needs to tap into knowledge that is both very broad, but specific to a domain, combinin g learning, structured representations of domain knowledge such as ontologies and reasoning t ools. In this paper, we present a decision- aid tool in case of malfunction of high power indus trial steam boiler. For this purpose an ontology was developed and considered as a prior co nceptual knowledge in Inductive Logic Programming (ILP for inducing diagnosis rules. The next step of the process concerns the inclusion of rules acquired by induction in the kno wledge base as well as their exploitation for reasoning.
Research on teacher education programs: logic model approach.
Newton, Xiaoxia A; Poon, Rebecca C; Nunes, Nicole L; Stone, Elisa M
2013-02-01
Teacher education programs in the United States face increasing pressure to demonstrate their effectiveness through pupils' learning gains in classrooms where program graduates teach. The link between teacher candidates' learning in teacher education programs and pupils' learning in K-12 classrooms implicit in the policy discourse suggests a one-to-one correspondence. However, the logical steps leading from what teacher candidates have learned in their programs to what they are doing in classrooms that may contribute to their pupils' learning are anything but straightforward. In this paper, we argue that the logic model approach from scholarship on evaluation can enhance research on teacher education by making explicit the logical links between program processes and intended outcomes. We demonstrate the usefulness of the logic model approach through our own work on designing a longitudinal study that focuses on examining the process and impact of an undergraduate mathematics and science teacher education program.
A Rewriting Logic Semantics Approach to Modular Program Analysis
M.A. Hills (Mark); G. Rosu (Grigore); C. Lynch
2010-01-01
htmlabstractThe K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on defining an evaluation semantics for a language, it is also possible to define an abstract semantics that can be
A Rewriting Logic Semantics Approach to Modular Program Analysis
Hills, M.A.; Rosu, G.; Lynch, C.
2010-01-01
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on defining an evaluation semantics for a language, it is also possible to define an abstract semantics that can be used for pr
Inference in Probabilistic Logic Programs using Weighted CNF's
Fierens, Daan; Thon, Ingo; Gutmann, Bernd; De Raedt, Luc
2012-01-01
Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. Several classical probabilistic inference tasks (such as MAP and computing marginals) have not yet received a lot of attention for this formalism. The contribution of this paper is that we develop efficient inference algorithms for these tasks. This is based on a conversion of the probabilistic logic program and the query and evidence to a weighted CNF formula. This allows us to reduce the inference tasks to well-studied tasks such as weighted model counting. To solve such tasks, we employ state-of-the-art methods. We consider multiple methods for the conversion of the programs as well as for inference on the weighted CNF. The resulting approach is evaluated experimentally and shown to improve upon the state-of-the-art in probabilistic logic programming.
[Plato psychiatrist, Foucault platonic].
Mathov, Nicolás
2016-05-01
This work explores the links between the concepts of "soul", "law" and "word" in Plato's work, in order to highlight the importance and the centrality of the philosophical-therapeutic dimension in the Greek philosopher's thought. In that way, this work pretends to show that "contemporary" problems usually discussed within "Human Sciences" in general, and Psychiatry in particular, should confront their knowledge with Plato's work, mainly due to the profound influence his ideas have had in our Greco-Christian culture. In that sense, and with that objective, this work also explores Michel Foucault's lucid and controversial interpretation of Plato.
Declarative semantics of programming in residuated lattice-valued logic
Institute of Scientific and Technical Information of China (English)
应明生
2000-01-01
We give two generalizations of Tarski’s fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski’s least fixpoint semantics for residuated lattice-valued logic programs.
Declarative semantics of programming in residuated lattice-valued logic
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
We give two generalizations of Tarski's fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski's least fixpoint semantics for residuated lattice-valued logic programs.
Logic Models for Program Design, Implementation, and Evaluation: Workshop Toolkit. REL 2015-057
Shakman, Karen; Rodriguez, Sheila M.
2015-01-01
The Logic Model Workshop Toolkit is designed to help practitioners learn the purpose of logic models, the different elements of a logic model, and the appropriate steps for developing and using a logic model for program evaluation. Topics covered in the sessions include an overview of logic models, the elements of a logic model, an introduction to…
Fuzzy logic program at SGS-Thomson
Pagni, Andrea; Poluzzi, Rinaldo; Rizzotto, GianGuido
1993-12-01
From its conception by Professor Lotfi A. Zadeh in the early '60s, Fuzzy Logic has slowly won acceptance, first in the academic world, then in industry. Its success is mainly due to the different perspective with which problems are tackled. Thanks to Fuzzy Logic we have moved from a numerical/analytical description to a quantitative/qualitative one. It is important to stress that this different perspective not only allows us to solve analysis/control problems at lower costs but can also allow otherwise insoluble problems to be solved at acceptable costs. Of course, it must be stressed that Fuzzy Systems cannot match the computational precision of traditional techniques but seek, instead, to find acceptable solutions in shorter times. Recognizing the enormous importance of fuzzy logic in the markets of the future, SGS-THOMSON intends to produce devices belonging to a new class of machines: Fuzzy Computational Machines. For this purpose a major research project has been established considering the architectural aspects and system implications of fuzzy logic, the development of dedicated VLSI components and supporting software.
A Non-Termination Criterion for Binary Constraint Logic Programs
Payet, Etienne
2008-01-01
On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches: dynamic versus static analysis, this paper belongs to the latter. It proposes a criterion for detecting non-terminating atomic queries with respect to binary CLP rules, which strictly generalizes our previous works on this subject. We give a generic operational definition and an implemented logical form of this criterion. Then we show that the logical form is correct and complete with respect to the operational definition.
Detection of And—Parallelism in Logic Programs
Institute of Scientific and Technical Information of China (English)
黄志毅; 胡守仁
1990-01-01
In this paper,we present a detection technique of and-parallelism in logic programs.The detection consists of three phases:analysis of entry modes,derivation of exit modes and determination of execution graph expressions.Compared with other techniques[2,4,5],our approach with the compile-time program-level data-dependence analysis of logic programs,can efficiently exploit and-parallelism in logic programs.Two precompilers,based on our technique and DeGroot's approach[3] respectively,have been implemented in SES-PIM system[12],Through compiling and running some typical benchmarks in SES-PIM,we conclude that our technique can,in most cases,exploit as much and-parallelism as the dynamic approach[13]does under“produces-consumer”scheme,and needs less dynamic overhead while exploiting more and parallelism than DeGroot's approach does.
Probabilistic Abductive Logic Programming in Constraint Handling Rules
DEFF Research Database (Denmark)
Christiansen, Henning
A class of Probabilistic Abductive Logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-explanations and most-probable-explanations versions are given. % Compared with other...... probabilistic versions of abductive logic programming, the approach is characterized by higher generality and a flexible and adaptable architecture which incorporates integrity constraints and interaction with external constraint solvers. % A PALP is translated in a systematic way into a CHR program which...
Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
DEFF Research Database (Denmark)
Christiansen, Henning
2008-01-01
A class of Probabilistic Abductive Logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-explanations and most-probable-explanations versions are given. Compared with other...... probabilistic versions of abductive logic programming, the approach is characterized by higher generality and a flexible and adaptable architecture which incorporates integrity constraints and interaction with external constraint solvers. A PALP is transformed in a systematic way into a CHR program which serves...
Programming Programmable Logic Controller. High-Technology Training Module.
Lipsky, Kevin
This training module on programming programmable logic controllers (PLC) is part of the memory structure and programming unit used in a packaging systems equipment control course. In the course, students assemble, install, maintain, and repair industrial machinery used in industry. The module contains description, objectives, content outline,…
Using Logic Programming to Detect Activities in Pervasive Healthcare
DEFF Research Database (Denmark)
Christensen, Henrik Bærbak
2002-01-01
In this experience paper we present a case study in using logic programming in a pervasive computing project in the healthcare domain. An expert system is used to detect healthcare activities in a pervasive hospital environment where positions of people and things are tracked. Based on detected...... activities an activity-driven computing infrastructure provides computational assistance to healthcare staff on mobile-and pervasive computing equipment. Assistance range from simple activities like fast log-in into the electronic patient medical record system to complex activities like signing for medicine...... given to specific patients. We describe the role of logic programming in the infrastructure and discuss the benefits and problems of using logic programming in a pervasive context....
A New Integrated System of Logic Programming and Relational Database
Institute of Scientific and Technical Information of China (English)
邓铁清; 吴泉源; 等
1993-01-01
Based on the study of the current two methods-interpretation and compilation-for the integration of logic programming and relational database,a new precompilation-based interpretive approach is proposed.It inherits the advantages of both methods,but overcomes the drawbacks of theirs.A new integrated system based on this approach is presented,which has been implemented on Micro VAX Ⅱ and applied to practise as the kernel of the GKBMS knowledge base management system.Also discussed are the key implementation techniques,including the coupling of logic and relational database systems,the compound of logic and relational database languages,the partial evaluation and static optimization of user's programs,fact scheduling and version management in problem-solving.
Constraint Logic Programming approach to protein structure prediction
Directory of Open Access Journals (Sweden)
Fogolari Federico
2004-11-01
Full Text Available Abstract Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Results Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. Conclusions The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.
Application of Logic Models in a Large Scientific Research Program
O'Keefe, Christine M.; Head, Richard J.
2011-01-01
It is the purpose of this article to discuss the development and application of a logic model in the context of a large scientific research program within the Commonwealth Scientific and Industrial Research Organisation (CSIRO). CSIRO is Australia's national science agency and is a publicly funded part of Australia's innovation system. It conducts…
Application of Logic Models in a Large Scientific Research Program
O'Keefe, Christine M.; Head, Richard J.
2011-01-01
It is the purpose of this article to discuss the development and application of a logic model in the context of a large scientific research program within the Commonwealth Scientific and Industrial Research Organisation (CSIRO). CSIRO is Australia's national science agency and is a publicly funded part of Australia's innovation system. It conducts…
Analysis of Logic Programs Using Regular Tree Languages
DEFF Research Database (Denmark)
Gallagher, John Patrick
2012-01-01
The eld of nite tree automata provides fundamental notations and tools for reasoning about set of terms called regular or recognizable tree languages. We consider two kinds of analysis using regular tree languages, applied to logic programs. The rst approach is to try to discover automatically a ...... to the analysis is a program and a tree automaton, and the output is an abstract model of the program. These two contrasting abstract interpretations can be used in a wide range of analysis and verication problems.......The eld of nite tree automata provides fundamental notations and tools for reasoning about set of terms called regular or recognizable tree languages. We consider two kinds of analysis using regular tree languages, applied to logic programs. The rst approach is to try to discover automatically...... a tree automaton from a logic program, approximating its minimal Herbrand model. In this case the input for the analysis is a program, and the output is a tree automaton. The second approach is to expose or check properties of the program that can be expressed by a given tree automaton. The input...
Answer Set Programming for Continuous Domains A Fuzzy Logic Approach
Janssen, Jeroen; Vermeir, Dirk
2012-01-01
"Answer set programming (ASP)" is a declarative language tailored towards solving combinatorial optimization problems. It has been successfully applied to e.g. planning problems, configuration and verification of software, diagnosis and database repairs. However, ASP is not directly suitable for modeling problems with continuous domains. Such problems occur naturally in diverse fields such as the design of gas and electricity networks, computer vision and investment portfolios. To overcome this problem we study FASP, a combination of ASP with fuzzy logic - a class of manyvalued logic
The Magic of Logical Inference in Probabilistic Programming
Gutmann, Bernd; Kimmig, Angelika; Bruynooghe, Maurice; De Raedt, Luc; 10.1017/S1471068411000238
2011-01-01
Today, many different probabilistic programming languages exist and even more inference mechanisms for these languages. Still, most logic programming based languages use backward reasoning based on SLD resolution for inference. While these methods are typically computationally efficient, they often can neither handle infinite and/or continuous distributions, nor evidence. To overcome these limitations, we introduce distributional clauses, a variation and extension of Sato's distribution semantics. We also contribute a novel approximate inference method that integrates forward reasoning with importance sampling, a well-known technique for probabilistic inference. To achieve efficiency, we integrate two logic programming techniques to direct forward sampling. Magic sets are used to focus on relevant parts of the program, while the integration of backward reasoning allows one to identify and avoid regions of the sample space that are inconsistent with the evidence.
tactusLogic: programming using physical objects
CSIR Research Space (South Africa)
Smith, Andrew C
2011-05-01
Full Text Available ] Mitchel Resnick, John Maloney, Andr?s Monroy-Hern?ndez, Natalie Rusk, Evelyn Eastmond, Karen Brennan, Amon Millner, Eric Rosenbaum, Jay Silver, Brian Silverman, and Yasmin Kafai. Scratch: programming for all. Commun. ACM, 52(11):60?67, 2009. printed 9...
A Data Bank Experience on the PLATO System.
Schwab, Wallace; St-Denis, Richard
1980-01-01
Current theories on terminology and lexicography which underlie the logical components of the terminology bank set up on the PLATO system and established standards are briefly presented. The units that were essential to developing the bank are discussed. References are listed. (Author)
The CGE-PLATO Electronic Laboratory Station Structure and Operation.
Neal, J. P.
An electronic laboratory station was designed for student use in learning electronic instrumentation and measurement by means of the computer-guided experimentation (CGE) system. The station features rack-mounted electronic laboratory equipment on a laboratory table adjacent to a PLATO IV terminal. An integrated logic system behind the laboratory…
An Automatic Tutor for Introductory Programming Students.
Danielson, Ronald L.; Nievergelt, Jurg
A program was developed to use the PLATO IV system of the University of Illinois to help students solve typical programing problems. The program tries to approximate a near-ideal situation in which each student receives correction of logical errors and comments on good programing practice as he goes along in a one-on-one tutorial environment. The…
Specifying Logic Programs in Controlled Natural Language
Fuchs, N; Fuchs, Norbert E.; Schwitter, Rolf
1995-01-01
Writing specifications for computer programs is not easy since one has to take into account the disparate conceptual worlds of the application domain and of software development. To bridge this conceptual gap we propose controlled natural language as a declarative and application-specific specification language. Controlled natural language is a subset of natural language that can be accurately and efficiently processed by a computer, but is expressive enough to allow natural usage by non-specialists. Specifications in controlled natural language are automatically translated into Prolog clauses, hence become formal and executable. The translation uses a definite clause grammar (DCG) enhanced by feature structures. Inter-text references of the specification, e.g. anaphora, are resolved with the help of discourse representation theory (DRT). The generated Prolog clauses are added to a knowledge base. We have implemented a prototypical specification system that successfully processes the specification of a simple...
DEFF Research Database (Denmark)
Larsen, Øjvind
2012-01-01
Plato is normally taken as one of the founders of Western political philosophy, not at least with his Republic. Here, he constructs a hierarchy of forms of governments, beginning with aristocracy at the top as a critical standard for the other forms of governments, and proceeding through timocrac......’ funeral oration is used to show that Pericles presented a democratic political philosophy that can serve as a counterpoint to Plato’s political philosophy in the Republic....
The Least Fixpoint Transformation for Disjunctive Logic Programs
Institute of Scientific and Technical Information of China (English)
王克文; 陈火旺; 等
1998-01-01
The paradigm of disjunctive logic programming(DLP)enhances greatly the expressive power of normal logic programming(NLP)and many(declarative)semantics have been defined for DLP to cope with various problems of knowledge representation in artificial intelligence.However,the expressive ability of the semantics and the soundness of program transformations for DLP have been rarely explored.This paper defines an immediate consequence operatro TGP for each disjunctive program and shows that TGP has the least and computable fixpoint Lft(P),Lft is,in fact,a program transformation for DLP,which transforms all disjunctive programs into negative programs.It is shown that Lft preserves many key semantics,including the disjunctive stable models,well-founded model,disjunctive argunent semantics DAS,three-valued models,ect.Thic means that every disjunctive program P has a unique canonical form Lft(P)with respect to these semantics.As a result,the work in this paper provides a unifying framework for studying the expressive ability of various semantics for DLP On the other hand,the computing of the above semantics for negative programs is ust a trivial task,therefore,Lft(P)is also an optimization method for DLP.Another application of Lft is to derive some interesting semantic results for DLP.
Automated verification of pointer programs in pointer logic
Institute of Scientific and Technical Information of China (English)
Zhifang WANG; Yiyun CHEN; Zhenming WANG; Baojian HUA
2008-01-01
Reasoning about pointer programs is difficult and challenging, while their safety is critical in software engineering. Storeless semantics pioneered by Jonkers provides a method to reason about pointer programs. However, the representation of memory states in Jonkers' model is costly and redundant. This paper pre-sents a new framework under a more efficient storeless model for automatically verifying properties of pointer programs related to the correct use of dynamically allo-cated memory such as absence of null dereferences, absence of dangling dereferences, absence of memory leaks, and preservation of structural invariants. The intro-duced logic-Pointer Logic, is developed to achieve such goals. To demonstrate that Pointer Logic is a useful store-less approach to verification, the Schorr-Waite tree-tra-versal algorithm which is always considered as a key test for pointer formalizations was verified via our analysis. Moreover, an experimental tool-plcc was implemented to automatically verify a number of non-trivial pointer programs.
A characterization of answer sets for logic programs
Institute of Scientific and Technical Information of China (English)
ZHANG MingYi; ZHANG Ying; FangZhen LIN
2007-01-01
Checking if a program has an answer set, and if so, compute its answer sets are just some of the important problems in answer set logic programming. Solving these problems using Gelfond and Lifschitz's original definition of answer sets is not an easy task. Alternative characterizations of answer sets for nested logic programs by Erdem and Lifschitz, Lee and Lifschitz, and You et al. are based on the completion semantics and various notions of tightness. However, the notion of tightness is a local notion in the sense that for different answer sets there are, in general, different level mappings capturing their tightness. This makes it hard to be used in the design of algorithms for computing answer sets. This paper proposes a characterization of answer sets based on sets of generating rules. From this characterization new algorithms are derived for computing answer sets and for performing some other reasoning tasks. As an application of the characterization a sufficient and necessary condition for the equivalence between answer set semantics and completion semantics has been proven, and a basic theorem is shown on computing answer sets for nested logic programs based on an extended notion of loop formulas. These results on tightness and loop formulas are more general than that in You and Lin's work.
Constraints and Logic Programming in Grammars and Language Analysis
DEFF Research Database (Denmark)
Christiansen, Henning
2014-01-01
Constraints are an important notion in grammars and language analysis, and constraint programming techniques have been developed concurrently for solving a variety of complex problems. In this chapter we consider the synthesis of these branches into practical and effective methods for language...... methods that combine constraints with logic grammars such as Definite Clause Grammars and CHR Grammars, and show also a direct relationship to abductive reasoning....
Accelerating Activation Function for 3- Satisfiability Logic Programming
Directory of Open Access Journals (Sweden)
Mohd Asyraf Mansor
2016-10-01
Full Text Available This paper presents the technique for accelerating 3-Satisfiability (3-SAT logic programming in Hopfield neural network. The core impetus for this work is to integrate activation function for doing 3-SAT logic programming in Hopfield neural network as a single hybrid network. In logic programming, the activation function can be used as a dynamic post optimization paradigm to transform the activation level of a unit (neuron into an output signal. In this paper, we proposed Hyperbolic tangent activation function and Elliot symmetric activation function. Next, we compare the performance of proposed activation functions with a conventional function, namely McCu lloch-Pitts function. In this study, we evaluate the performances between these functions through computer simulations. Microsoft Visual C++ 2013 was used as a platform for training, validating and testing of the network. We restrict our analysis to 3-Satisfiability (3-SAT clauses. Moreover, evaluations are made between these activation functions to see the robustness via aspects of global solutions, global Hamming distance, and CPU time.
Verification and Planning Based on Coinductive Logic Programming
Bansal, Ajay; Min, Richard; Simon, Luke; Mallya, Ajay; Gupta, Gopal
2008-01-01
Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution
Program generic set:semantics of medium logic program described by forcing
Institute of Scientific and Technical Information of China (English)
朱朝晖; 施庆生; 朱梧槚
1996-01-01
The technique of forcing created by Cohen is adopted to discuss the semantics of medium logic program without closed-world assumption (CWA).The fixed point and complete-meet semilattice property ofprogram generic set is proved.
PLATO Sitcom Dialogs for Russian.
Dawson, Clayton; Provenzano, Nolen
1981-01-01
Situation comedy (sitcom) dialogs that are included in PLATO lessons for first year Russian students are described. These comprehension exercises make use of both the touch panel and the audio capabilities of PLATO. The sitcom dialogs were written by a native speaker of Russian and are based on the vocabulary in the textbook plus a small number of…
Applying Logic Programming to Knowledge Discovery on the Internet
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
LP （Logic Programming） has been successfully applied to knowledgediscovery in many fields. The execution of the LP is based on the evaluation of the first or der predicate. Usually the information involved in the predicates are local and homogenous, thus the evaluation process is relatively simple. However, the evalu ation process become much more complicated when applied to KDD on the Internet w here the information involved in the predicates maybe heterogeneous and distribu ted over many different sits. Therefor, we try to attack the problem in a multi - agent system's framework so that the logic program can be written in a site-ind ependent style and deal easily with heterogeneous represented information.
Permission-based separation logic for multi-threaded Java programs
Amighi, A.; Haack, Christian; Huisman, Marieke; Hurlin, C.
2015-01-01
This paper presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent sep
Permission-based separation logic for multi-threaded Java programs
Amighi, A.; Haack, Christian; Huisman, Marieke; Hurlin, C.
This paper presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent
Programmed DNA Self-Assembly and Logic Circuits
Li, Wei
DNA is a unique, highly programmable and addressable biomolecule. Due to its reliable and predictable base recognition behavior, uniform structural properties, and extraordinary stability, DNA molecules are desirable substrates for biological computation and nanotechnology. The field of DNA computation has gained considerable attention due to the possibility of exploiting the massive parallelism that is inherent in natural systems to solve computational problems. This dissertation focuses on building novel types of computational DNA systems based on both DNA reaction networks and DNA nanotechnology. A series of related research projects are presented here. First, a novel, three-input majority logic gate based on DNA strand displacement reactions was constructed. Here, the three inputs in the majority gate have equal priority, and the output will be true if any two of the inputs are true. We subsequently designed and realized a complex, 5-input majority logic gate. By controlling two of the five inputs, the complex gate is capable of realizing every combination of OR and AND gates of the other 3 inputs. Next, we constructed a half adder, which is a basic arithmetic unit, from DNA strand operated XOR and AND gates. The aim of these two projects was to develop novel types of DNA logic gates to enrich the DNA computation toolbox, and to examine plausible ways to implement large scale DNA logic circuits. The third project utilized a two dimensional DNA origami frame shaped structure with a hollow interior where DNA hybridization seeds were selectively positioned to control the assembly of small DNA tile building blocks. The small DNA tiles were directed to fill the hollow interior of the DNA origami frame, guided through sticky end interactions at prescribed positions. This research shed light on the fundamental behavior of DNA based self-assembling systems, and provided the information necessary to build programmed nanodisplays based on the self-assembly of DNA.
Contour tracking and corner detection in a logic programming environment
DEFF Research Database (Denmark)
Bell, Benjamin; Pau, L. F.
1990-01-01
The added functionality such as contour tracking and corner detection which logic programming lends to standard image operators is described. An environment for implementing low-level imaging operations with Prolog predicates is considered. Within this environment, higher-level image predicates...... has been very good in many more complex images, as it allows for feedback both ways between sensor input and symbolic models. More important is the parameter selection capability in a dynamic version where background properties change. The authors present examples of Prolog predicates for performing...
An Inplementation of Pure Horn Clause Logic Programming in a Reduction System
Institute of Scientific and Technical Information of China (English)
许满武
1993-01-01
Many reduction systems have been presented for implementing functional programming languages.We propose here an extension of a reduction architecture to realize a kind of logic programming-pure Horn clause logic programming.This is an attempt to approach amalgamation of the two important programming paradigms.
What scientists can learn from Plato's Symposium
van Emmerik, Tim
2015-04-01
Conferences and scientific meetings are as old as science itself. The ancient Greeks where (in)famous for organizing so-called symposiums. During a symposium (from Greek, drinking together), attendees followed a program that contained both social and scientific aspects, focused around a certain topic. Whilst drinking and eating, all participants were expected to share their vision on the topic of interest by giving an oral presentation. The goal of these meetings was to arrive at a new common understanding and to come closer to the truth. Plato et al. knew very well how to organize an effective scientific conference, which should make use overthink the way we are organizing present-day conferences. Scientific meetings aim to connect researchers, share research and unravel the truth. The question is now: how do we get this done effectively? Plato knew that discussing science with strangers is difficult and he believed that talking about heavy matter could be done best when combined with social events. What if we try to go back to the times of Plato and model our conferences after the ancient symposiums? We might drop laying on couches and covering ourselves in ivy and flowers. However, a mix of social and scientific events will contribute to achieving the ultimate goal of why scientists go to conferences: to connect, to share and to unravel the truth.
Verifying BPEL-like programs with Hoare logic
Institute of Scientific and Technical Information of China (English)
Chenguang LUO; Shengcbao QIN; Zongyan QIU
2008-01-01
The WS-BPEL language has recently become a de Jacto standard for modeling Web-based business pro-cesses. Onc of its essential features is the fully program-mable compensation mechanism. To understand it better, many recent works have mainly focused on formal semantic models for WS-BPEL. In this paper, we make one step forward by investigating the verification problem for business processes written in BPEL-Iike languages. We propose a set of proof rules in Hoare-logic style as an axiomatic verification system for a BPEL-like core lan-guage containing key features such as data states, fault and compensation handling. We also propose a big-step operational semantics which incorporates all these key features. Our verification rules are proven sound with respect to this underlying semantics. The application of the verification rules is illustrated via the proof search process for a nontrivial example.
Knowledge discovery in variant databases using inductive logic programming.
Nguyen, Hoan; Luu, Tien-Dao; Poch, Olivier; Thompson, Julie D
2013-01-01
Understanding the effects of genetic variation on the phenotype of an individual is a major goal of biomedical research, especially for the development of diagnostics and effective therapeutic solutions. In this work, we describe the use of a recent knowledge discovery from database (KDD) approach using inductive logic programming (ILP) to automatically extract knowledge about human monogenic diseases. We extracted background knowledge from MSV3d, a database of all human missense variants mapped to 3D protein structure. In this study, we identified 8,117 mutations in 805 proteins with known three-dimensional structures that were known to be involved in human monogenic disease. Our results help to improve our understanding of the relationships between structural, functional or evolutionary features and deleterious mutations. Our inferred rules can also be applied to predict the impact of any single amino acid replacement on the function of a protein. The interpretable rules are available at http://decrypthon.igbmc.fr/kd4v/.
The Body Logic Program for Adolescents: A Treatment Manual for the Prevention of Eating Disorders
Varnado-Sullivan, Paula J.; Zucker, Nancy
2004-01-01
The Body Logic Program for Adolescents was developed as a two-stage intervention to prevent the development of eating disorder symptoms. Preliminary results indicate that this program shows promise as an effective prevention effort. The current article provides a detailed description of the protocol for implementing Body Logic Part I, a…
Directory of Open Access Journals (Sweden)
Zahra Nouri Sanghdehi
2017-07-01
Full Text Available One of the greatest problems in Plato that appears in different forms in his works is the relation of nomos and phusis. This thesis has been in fifth century B.C as the contradiction of phusis and nomos among big thinkers. In this essay, we tried to investigate the relation of phusis and nomos in Plato’s thoughts according to current theories of the contradiction of these in dialogues Gorgias, Republic and Protagoras. Plato tries to minimize consequences of belief to contradiction of phusis and nomos in social and political life by assertion large scale relation between phusis and nomos. Plato depicts the ultimate solution of this problem in Law. There he accounts nomos as raised from phusis that is sub sovereignty of divine. Indeed union of phusis and gods in Plato’s thought is sanction for the identity of phusis and nomos.
Knowledge discovery for pancreatic cancer using inductive logic programming.
Qiu, Yushan; Shimada, Kazuaki; Hiraoka, Nobuyoshi; Maeshiro, Kensei; Ching, Wai-Ki; Aoki-Kinoshita, Kiyoko F; Furuta, Koh
2014-08-01
Pancreatic cancer is a devastating disease and predicting the status of the patients becomes an important and urgent issue. The authors explore the applicability of inductive logic programming (ILP) method in the disease and show that the accumulated clinical laboratory data can be used to predict disease characteristics, and this will contribute to the selection of therapeutic modalities of pancreatic cancer. The availability of a large amount of clinical laboratory data provides clues to aid in the knowledge discovery of diseases. In predicting the differentiation of tumour and the status of lymph node metastasis in pancreatic cancer, using the ILP model, three rules are developed that are consistent with descriptions in the literature. The rules that are identified are useful to detect the differentiation of tumour and the status of lymph node metastasis in pancreatic cancer and therefore contributed significantly to the decision of therapeutic strategies. In addition, the proposed method is compared with the other typical classification techniques and the results further confirm the superiority and merit of the proposed method.
Second Summative Report of the Delaware PLATO Project.
Hofstetter, Fred T.
Begun on an experimental basis in March 1975, the ongoing PLATO project at the University of Delaware has become an established part of the University's academic program. This descriptive report is divided into three sections: (1) project history and development, including organization, utilization, instructor and author training, and projections…
Tremblay, Marie-Claude; Brousselle, Astrid; Richard, Lucie; Beaudet, Nicole
2013-10-01
Program designers and evaluators should make a point of testing the validity of a program's intervention theory before investing either in implementation or in any type of evaluation. In this context, logic analysis can be a particularly useful option, since it can be used to test the plausibility of a program's intervention theory using scientific knowledge. Professional development in public health is one field among several that would truly benefit from logic analysis, as it appears to be generally lacking in theorization and evaluation. This article presents the application of this analysis method to an innovative public health professional development program, the Health Promotion Laboratory. More specifically, this paper aims to (1) define the logic analysis approach and differentiate it from similar evaluative methods; (2) illustrate the application of this method by a concrete example (logic analysis of a professional development program); and (3) reflect on the requirements of each phase of logic analysis, as well as on the advantages and disadvantages of such an evaluation method. Using logic analysis to evaluate the Health Promotion Laboratory showed that, generally speaking, the program's intervention theory appeared to have been well designed. By testing and critically discussing logic analysis, this article also contributes to further improving and clarifying the method. Copyright © 2013 Elsevier Ltd. All rights reserved.
Jaegers, Lisa; Dale, Ann Marie; Weaver, Nancy; Buchholz, Bryan; Welch, Laura; Evanoff, Bradley
2014-03-01
Intervention studies in participatory ergonomics (PE) are often difficult to interpret due to limited descriptions of program planning and evaluation. In an ongoing PE program with floor layers, we developed a logic model to describe our program plan, and process and summative evaluations designed to describe the efficacy of the program. The logic model was a useful tool for describing the program elements and subsequent modifications. The process evaluation measured how well the program was delivered as intended, and revealed the need for program modifications. The summative evaluation provided early measures of the efficacy of the program as delivered. Inadequate information on program delivery may lead to erroneous conclusions about intervention efficacy due to Type III error. A logic model guided the delivery and evaluation of our intervention and provides useful information to aid interpretation of results. © 2013 Wiley Periodicals, Inc.
Computing single step operators of logic programming in radial basis function neural networks
Energy Technology Data Exchange (ETDEWEB)
Hamadneh, Nawaf; Sathasivam, Saratha; Choon, Ong Hong [School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)
2014-07-10
Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.
Computing single step operators of logic programming in radial basis function neural networks
Hamadneh, Nawaf; Sathasivam, Saratha; Choon, Ong Hong
2014-07-01
Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (Tp:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.
Saha, Diptikalyan
2009-01-01
In this work, we present an automatic way to parallelize logic programs for finding all the answers to queries using a transformation to low level threading primitives. Although much work has been done in parallelization of logic programming more than a decade ago (e.g., Aurora, Muse, YapOR), the current state of parallelizing logic programs is still very poor. This work presents a way for parallelism of tabled logic programs in XSB Prolog under the well founded semantics. An important contribution of this work relies in merging answer-tables from multiple children threads without incurring copying or full-sharing and synchronization of data-structures. The implementation of the parent-children shared answer-tables surpasses in efficiency all the other data-structures currently implemented for completion of answers in parallelization using multi-threading. The transformation and its lower-level answer merging predicates were implemented as an extension to the XSB system.
Schwab, Wallace; St-Denis, Richard
1980-01-01
Describes the elements and functioning of the terminology bank of the PLATO (Programmed Loqic for Automated Teaching Operation) system. Discusses contemporary terminology and lexicography notions on which the bank is based and outlines the tasks performed through PLATERM. (MES)
Schwab, Wallace; St-Denis, Richard
1980-01-01
Describes the elements and functioning of the terminology bank of the PLATO (Programmed Loqic for Automated Teaching Operation) system. Discusses contemporary terminology and lexicography notions on which the bank is based and outlines the tasks performed through PLATERM. (MES)
Extending Bayesian Logic Programs for Plan Recognition and Machine Reading
2011-05-01
involving several objects, their properties, and their relationships with other objects (Russell & Norvig , 2003). A term in first-order logic is a symbol that...Conference on Artificial Intel- ligence (IJCAI-95), pp. 1146–1152, Montreal, Canada. Russell, S., & Norvig , P. (2003). Artificial Intelligence: A Modern
A Fuzzy Logic Programming Environment for Managing Similarity and Truth Degrees
Directory of Open Access Journals (Sweden)
Pascual Julián-Iranzo
2015-01-01
Full Text Available FASILL (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language" is a fuzzy logic programming language with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. FASILL integrates and extends features coming from MALP (Multi-Adjoint Logic Programming, a fuzzy logic language with explicitly annotated rules and Bousi~Prolog (which uses a weak unification algorithm and is well suited for flexible query answering. Hence, it properly manages similarity and truth degrees in a single framework combining the expressive benefits of both languages. This paper presents the main features and implementations details of FASILL. Along the paper we describe its syntax and operational semantics and we give clues of the implementation of the lattice module and the similarity module, two of the main building blocks of the new programming environment which enriches the FLOPER system developed in our research group.
Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs
DEFF Research Database (Denmark)
Giesl, J.; Ströder, T.; Schneider-Kamp, P.
2013-01-01
There exist many powerful techniques to analyze termination and complexity of term rewrite systems (TRSs). Our goal is to use these techniques for the analysis of other programming languages as well. For instance, approaches to prove termination of definite logic programs by a transformation...... to TRSs have been studied for decades. However, a challenge is to handle languages with more complex evaluation strategies (such as Prolog, where predicates like the cut influence the control flow). We present a general methodology for the analysis of such programs. Here, the logic program is first...
Riguzzi, Fabrizio
2011-01-01
The distribution semantics is one of the most prominent approaches for the combination of logic programming and probability theory. Many languages follow this semantics, such as Independent Choice Logic, PRISM, pD, Logic Programs with Annotated Disjunctions (LPADs) and ProbLog. When a program contains functions symbols, the distribution semantics is well-defined only if the set of explanations for a query is finite and so is each explanation. Well-definedness is usually either explicitly imposed or is achieved by severely limiting the class of allowed programs. In this paper we identify a larger class of programs for which the semantics is well-defined together with an efficient procedure for computing the probability of queries. Since LPADs offer the most general syntax, we present our results for them, but our results are applicable to all languages under the distribution semantics. We present the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) that computes the probability of...
A Classification of Abduction :Abduction for Logic Programming
Hirata, Kouichi
1993-01-01
Abduction is a methodology of scientific researches. Peirce showed three types of abduction, and expressed them by one syllogism. Recently various researches on abduction or abductive logic have been developed in the fields of automated reasoning and machine learning. In order to systematically understand such researches and to clearly discuss abduction, this paper classifies abduction into five types. This new classification is based on an interpretation of the syllogism in abduction and the...
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
Pettorossi, Alberto; Proietti, Maurizio; Renault, Sophie
2003-01-01
Program specialization is a program transformation methodology which improves program efficiency by exploiting the information about the input data which are available at compile time. We show that current techniques for program specialization based on partial evaluation do not perform well on nondeterministic logic programs. We then consider a set of transformation rules which extend the ones used for partial evaluation, and we propose a strategy for guiding the application of these extended...
Verifying object-oriented programs with higher-order separation logic in Coq
DEFF Research Database (Denmark)
Bengtson, Jesper; Jensen, Jonas Braband; Sieczkowski, Filip;
2011-01-01
We present a shallow Coq embedding of a higher-order separation logic with nested triples for an object-oriented programming language. Moreover, we develop novel specification and proof patterns for reasoning in higher-order separation logic with nested triples about programs that use interfaces...... and interface inheritance. In particular, we show how to use the higher-order features of the Coq formalisation to specify and reason modularly about programs that (1) depend on some unknown code satisfying a specification or that (2) return objects conforming to a certain specification. All of our results have...
Horn逻辑程序和形式文法之间的对应关系%The Correspondence between Horn Logic Programs and Formal Grammars
Institute of Scientific and Technical Information of China (English)
陈文彬; 王驹
2003-01-01
The paper researches Horn logic programs with grammatical view. The correspondence between Horn logic programs and grammars is found. The method by which type-0 grammars generate the least Herbrand models of logic programs is found. The method by which Horn logic programs generate the languages of type-0 grammars is found.The characterization of Horn Logic programs that are semantically equavanent to type-2 grammars and type-3 grammars is found.
Constraint Logic Programming for Resolution of Relative Time Expressions
DEFF Research Database (Denmark)
Christiansen, Henning
2014-01-01
Translating time expression into absolute time points or durations is a challenge for natural languages processing such as text mining and text understanding in general. We present a constraint logic language CLP(Time) tailored to text usages concerned with time and calendar. It provides a simple...... and flexible formalism to express relationships between different time expressions in a text, thereby giving a recipe for resolving them into absolute time. A constraint solver is developed which, as opposed to some earlier approaches, is independent of the order in which temporal information is introduced...
Logic Models: A Tool for Effective Program Planning, Collaboration, and Monitoring. REL 2014-025
Kekahio, Wendy; Lawton, Brian; Cicchinelli, Louis; Brandon, Paul R.
2014-01-01
A logic model is a visual representation of the assumptions and theory of action that underlie the structure of an education program. A program can be a strategy for instruction in a classroom, a training session for a group of teachers, a grade-level curriculum, a building-level intervention, or a district-or statewide initiative. This guide, an…
Reasoning about Java programs in higher order logic using PVS and Isabelle
Huisman, Marieke
2001-01-01
This thesis describes the first steps of a project aimed at formal verification of Java programs. The work presented here is part of a larger project called LOOP, for Logic of Object Oriented Programming. A semantics for Java is described in type theory and it is shown how this semantics forms the
Reasoning about Java programs in higher order logic using PVS and Isabelle
Huisman, Marieke
2001-01-01
This thesis describes the first steps of a project aimed at formal verification of Java programs. The work presented here is part of a larger project called LOOP, for Logic of Object Oriented Programming. A semantics for Java is described in type theory and it is shown how this semantics forms the b
Hermenegildo, Manuel V.
1986-01-01
The term "Logic Programming" refers to a variety of computer languages and execution models which are based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in Artificial Intelligence, Knowledge-based systems, and many other areas of computing. The sequential execution speed of logic programs has been greatly improved sinc...
A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking
DEFF Research Database (Denmark)
Brunel, Julien Pierre Manuel; Doligez, Damien; Hansen, Rene Rydhof
2008-01-01
Reasoning about program control-flow paths is an important functionality of a number of recent program matching languages and associated searching and transformation tools. Temporal logic provides a well-defined means of expressing properties of control-flow paths in programs, and indeed...... an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found......-VW (CTL with variables and witnesses) that is a suitable basis for the semantics and implementation of the Coccinelle’s program matching language. Our extension to CTL includes existential quantification over program fragments, which allows metavariables in the program matching language to range over...
Comparison of Semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction
Institute of Scientific and Technical Information of China (English)
Xi-Shun Zhao; Yu-Ping Shen
2007-01-01
In this paper, it is shown that stable model semantics, perfect model semantics, and partial stable model semantics of disjunctive logic programs have the same expressive power with respect to the polynomial-time model-equivalent reduction. That is, taking perfect model semantics and stable model semantic as an example, any logic program P can be transformed in polynomial time to another logic program p' such that perfect models (resp. stable models) of P 1-1 correspond to stable models (resp. perfect models) of P', and the correspondence can be computed also in polynomial time. However, the minimal model semantics has weaker expressiveness than other mentioned semantics, otherwise, the polynomial hierarchy would collapse to NP.
Each normal logic program has a 2-valued Minimal Hypotheses semantics
Pinto, Alexandre Miguel
2011-01-01
In this paper we explore a unifying approach --- that of hypotheses assumption --- as a means to provide a semantics for all Normal Logic Programs (NLPs), the Minimal Hypotheses (MH) semantics. This semantics takes a positive hypotheses assumption approach as a means to guarantee the desirable properties of model existence, relevance and cumulativity, and of generalizing the Stable Models in the process. To do so we first introduce the fundamental semantic concept of minimality of assumed positive hypotheses, define the MH semantics, and analyze the semantics' properties and applicability. Indeed, abductive Logic Programming can be conceptually captured by a strategy centered on the assumption of abducibles (or hypotheses). Likewise, the Argumentation perspective of Logic Programs also lends itself to an arguments (or hypotheses) assumption approach. Previous works on Abduction have depicted the atoms of default negated literals in NLPs as abducibles, i.e., assumable hypotheses. We take a complementary and mo...
Evaluating bacterial gene-finding HMM structures as probabilistic logic programs
DEFF Research Database (Denmark)
Mørk, Søren; Holmes, Ian
2012-01-01
, a probabilistic dialect of Prolog. Results: We evaluate Hidden Markov Model structures for bacterial protein-coding gene potential, including a simple null model structure, three structures based on existing bacterial gene finders and two novel model structures. We test standard versions as well as ADPH length......Motivation: Probabilistic logic programming offers a powerful way to describe and evaluate structured statistical models. To investigate the practicality of probabilistic logic programming for structure learning in bioinformatics, we undertook a simplified bacterial gene-finding benchmark in PRISM...... modeling and three-state versions of the five model structures. The models are all represented as probabilistic logic programs and evaluated using the PRISM machine learning system in terms of statistical information criteria and gene-finding prediction accuracy, in two bacterial genomes. Neither of our...
A Formalization of the Semantics of Functional-Logic Programming in Isabelle
Fraguas, Francisco López; Hortalá, Juan Rodríguez
2009-01-01
Modern functional-logic programming languages like Toy or Curry feature non-strict non-deterministic functions that behave under call-time choice semantics. A standard formulation for this semantics is the CRWL logic, that specifies a proof calculus for computing the set of possible results for each expression. In this paper we present a formalization of that calculus in the Isabelle/HOL proof assistant. We have proved some basic properties of CRWL: closedness under c-substitutions, polarity and compositionality. We also discuss some insights that have been gained, such as the fact that left linearity of program rules is not needed for any of these results to hold.
Modelling and Analysis of Real Time Systems with Logic Programming and Constraints
DEFF Research Database (Denmark)
Banda, Gourinath
minimal model forms the basis for verifying the LHA model. We consider two techniques to verify the reactive properties specified as CTL formulas: (i) reachability analysis and (ii) model checking. A systematic translation of LHA models into constraint logic programs is de- fined. This is mechanised...... by a compiler. To facilitate forward and backward reasoning, two different ways to model an LHA are defined. A framework consist- ing of general purpose constraint logic program tools is presented to accomplish the reachability analysis to verify a class of safety and liveness properties. A tool to compute...
Automatic Coding Rule Conformance Checking Using Logic Programs
Marpons-Ucero, Guillem; Herranz, Ángel; Fredlund, Lars-Åke; Carro, Manuel; Moreno-Navarro, Juan José
2007-01-01
Some approaches to increasing program reliability involve a disciplined use of programming languages so as to minimise the hazards introduced by error-prone features. This is realised by writing code that is constrained to a subset of the a priori admissible programs, and that, moreover, may use only a subset of the language. These subsets are determined by a collection of so-called coding rules.
DEFF Research Database (Denmark)
Bolander, Thomas
2003-01-01
that we can keep the predicate approach if we make suitable restrictions to our set of epistemic axioms. Their results are proved by careful translations from corresponding modal formalisms. In the present paper we show that their results fit nicely into the framework of logic programming semantics......This paper concerns formal theories for reasoning about the knowledge and belief of agents. It has seemed attractive to researchers in artificial intelligence to formalise these propositional attitudes as predicates of first-order predicate logic. This allows the agents to express stronger......, in that we show their results to be corollaries of well-known results in this field. This does not only allow us to demonstrate a close connection between consistency problems in the syntactic treatment of propositional attitudes and problems in semantics for logic programs, but it also allows us...
Experimenting with recursive queries in database and logic programming systems
Terracina, Giorgio; Lio, Vincenzino; Panetta, Claudio
2007-01-01
This paper considers the problem of reasoning on massive amounts of (possibly distributed) data. Presently, existing proposals show some limitations: {\\em (i)} the quantity of data that can be handled contemporarily is limited, due to the fact that reasoning is generally carried out in main-memory; {\\em (ii)} the interaction with external (and independent) DBMSs is not trivial and, in several cases, not allowed at all; {\\em (iii)} the efficiency of present implementations is still not sufficient for their utilization in complex reasoning tasks involving massive amounts of data. This paper provides a contribution in this setting; it presents a new system, called DLV$^{DB}$, which aims to solve these problems. Moreover, the paper reports the results of a thorough experimental analysis we have carried out for comparing our system with several state-of-the-art systems (both logic and databases) on some classical deductive problems; the other tested systems are: LDL++, XSB, Smodels and three top-level commercial D...
Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
Truszczynski, Miroslaw
2010-01-01
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest. On the one hand, they reveal some reasons responsible for the hardness of computing answer sets. On the other hand, they identify classes of problem instances, for which the problem is "easy" (in P) or "easier than in general" (in NP). We obtain similar results for the complexity of reasoning with disjunctive programs under the supported-model semantics.
A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking
DEFF Research Database (Denmark)
Brunel, Julien Pierre Manuel; Doligez, Damien; Hansen, Rene Rydhof
2008-01-01
an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found......, using a transformation rule that fixes several reference count bugs in Linux code....
A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking
DEFF Research Database (Denmark)
Brunel, Julien; Doligez, Damien; Hansen, Rene Rydhof
2009-01-01
an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found...... a transformation rule that fixes several reference count bugs in Linux code. ...
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
DEFF Research Database (Denmark)
Albert, Elvira; Puebla, German; Gallagher, John Patrick
2006-01-01
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exceptions), and those whose truth value varies according to the degree of instantiation of arguments. In particular, non...
Martin, Ian; Carey, John
2014-01-01
A logic model was developed based on an analysis of the 2012 American School Counselor Association (ASCA) National Model in order to provide direction for program evaluation initiatives. The logic model identified three outcomes (increased student achievement/gap reduction, increased school counseling program resources, and systemic change and…
Genetic program based data mining to reverse engineer digital logic
Smith, James F., III; Nguyen, Thanh Vu H.
2006-04-01
A data mining based procedure for automated reverse engineering and defect discovery has been developed. The data mining algorithm for reverse engineering uses a genetic program (GP) as a data mining function. A genetic program is an algorithm based on the theory of evolution that automatically evolves populations of computer programs or mathematical expressions, eventually selecting one that is optimal in the sense it maximizes a measure of effectiveness, referred to as a fitness function. The system to be reverse engineered is typically a sensor. Design documents for the sensor are not available and conditions prevent the sensor from being taken apart. The sensor is used to create a database of input signals and output measurements. Rules about the likely design properties of the sensor are collected from experts. The rules are used to create a fitness function for the genetic program. Genetic program based data mining is then conducted. This procedure incorporates not only the experts' rules into the fitness function, but also the information in the database. The information extracted through this process is the internal design specifications of the sensor. Uncertainty related to the input-output database and the expert based rule set can significantly alter the reverse engineering results. Significant experimental and theoretical results related to GP based data mining for reverse engineering will be provided. Methods of quantifying uncertainty and its effects will be presented. Finally methods for reducing the uncertainty will be examined.
MELD: A Logical Approach to Distributed and Parallel Programming
2012-03-01
USA: ACM, 1974, pp. 249–264. [14] M. Isard , M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, “Dryad: Distributed data-parallel programs from sequential...TR-2006-140. [Online]. Available: http://budiu.info/work/eurosys07.pdf [15] Y. Yu, M. Isard , D. Fetterly, M. Budiu, Ú . Erlingsson, P. K. Gunda
Probabilistic Planning with Imperfect Sensing Actions Using Hybrid Probabilistic Logic Programs
Saad, Emad
Effective planning in uncertain environment is important to agents and multi-agents systems. In this paper, we introduce a new logic based approach to probabilistic contingent planning (probabilistic planning with imperfect sensing actions), by relating probabilistic contingent planning to normal hybrid probabilistic logic programs with probabilistic answer set semantics [24]. We show that any probabilistic contingent planning problem can be encoded as a normal hybrid probabilistic logic program. We formally prove the correctness of our approach. Moreover, we show that the complexity of finding a probabilistic contingent plan in our approach is NP-complete. In addition, we show that any probabilistic contingent planning problem, \\cal PP, can be encoded as a classical normal logic program with answer set semantics, whose answer sets corresponds to valid trajectories in \\cal PP. We show that probabilistic contingent planning problems can be encoded as SAT problems. We present a new high level probabilistic action description language that allows the representation of sensing actions with probabilistic outcomes.
Teaching Artificial Intelligence and Logic Programming in a Competitive Environment
Directory of Open Access Journals (Sweden)
Pedro RIBEIRO
2009-04-01
Full Text Available Motivation plays a key role in the learning process. This paper describes an experience in the context of undergraduate teaching of Artificial Intelligence at the Computer Science Department of the Faculty of Sciences in the University of Porto. A sophisticated competition framework, which involved Prolog programmed contenders and game servers, including an appealing GUI, was developed to motivate students on the deepening of the topics covered in class. We report on the impact that such a competitive setup caused on students' commitment, which surpassed our most optimistic expectations.
Automatic Analysis of the Logical Structure of Programs,
1978-12-01
this program is discussed in much more detail in chapters VI and VII. 1 C PURPOSE 2 C INTEGRATES A FIRST ORDER DIFFERENTIAL EQUATION 3 C DY/DX=FUN(X.Y...discussed in chapters VI and VII. Richard C. Waters - 195 - A Mini Programmer’s Apprentice 1 C PURPOSE 2 C INTEGRATES A FIRST ORDER DIFFERENTIAL EQUATION 3 C...113]. Zilles [116] and Guttag (40] have developed a formal descriptive system, called a data algebra, for describing the behavior of a data
Program Verification with Monadic Second-Order Logic & Languages for Web Service Development
DEFF Research Database (Denmark)
Møller, Anders
that only valid HTML documents are ever shown to the clients at runtime and that the documents are constructed consistently. In addition, the language design provides support for declarative form-field validation, caching of dynamic documents, concurrency control based on temporal-logic specifications......Domain-specific formal languages are an essential part of computer science, combining theory and practice. Such languages are characterized by being tailor-made for specific application domains and thereby providing expressiveness on high abstraction levels and allowing specialized analysis...... and verification techniques. This dissertation describes two projects, each exploring one particular instance of such languages: monadic second-order logic and its application to program verification, and programming languages for construction of interactive Web services. Both program verification and Web service...
Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming
Lisi, Francesca A
2007-01-01
Building rules on top of ontologies is the ultimate goal of the logical layer of the Semantic Web. To this aim an ad-hoc mark-up language for this layer is currently under discussion. It is intended to follow the tradition of hybrid knowledge representation and reasoning systems such as $\\mathcal{AL}$-log that integrates the description logic $\\mathcal{ALC}$ and the function-free Horn clausal language \\textsc{Datalog}. In this paper we consider the problem of automating the acquisition of these rules for the Semantic Web. We propose a general framework for rule induction that adopts the methodological apparatus of Inductive Logic Programming and relies on the expressive and deductive power of $\\mathcal{AL}$-log. The framework is valid whatever the scope of induction (description vs. prediction) is. Yet, for illustrative purposes, we also discuss an instantiation of the framework which aims at description and turns out to be useful in Ontology Refinement. Keywords: Inductive Logic Programming, Hybrid Knowledge...
The SITE Program funded a field demonstration to evaluate the Eco Logic Gas-Phase Chemical Reduction Process developed by ELI Eco Logic International Inc. (ELI), Ontario, Canada. The Demonstration took place at the Middleground Landfill in Bay City, Michigan using landfill wa...
Program Verification with Monadic Second-Order Logic & Languages for Web Service Development
DEFF Research Database (Denmark)
Møller, Anders
development are areas of programming language research that have received increased attention during the last years. We first show how the logic Weak monadic Second-order Logic on Strings and Trees can be implemented efficiently despite an intractable theoretical worst-case complexity. Among several other......, such as maintaining session state and dynamically producing HTML or XML documents. By introducing explicit language-based mechanisms for those issues, we liberate the Web service programmer from the tedious and error-prone alternatives. Specialized program analyses aid the programmer by verifying at compile time......Domain-specific formal languages are an essential part of computer science, combining theory and practice. Such languages are characterized by being tailor-made for specific application domains and thereby providing expressiveness on high abstraction levels and allowing specialized analysis...
Efficient methods for solving discrete topology design problems in the PLATO-N project
DEFF Research Database (Denmark)
Canh, Nam Nguyen; Stolpe, Mathias
This paper considers the general multiple load structural topology design problems in the framework of the PLATO-N project. The problems involve a large number of discrete design variables and were modeled as a non-convex mixed 0–1 program. For the class of problems considered, a global optimizat......This paper considers the general multiple load structural topology design problems in the framework of the PLATO-N project. The problems involve a large number of discrete design variables and were modeled as a non-convex mixed 0–1 program. For the class of problems considered, a global...
Live programming support in the LogicBlox system: a MetaLogiQL approach
2015-01-01
The emerging category of self-service enterprise applications motivates support for “live programming” in the database, where the user’s iterative data exploration triggers changes to installed application code and its output in real time. This paper discusses the technical challenges in supporting live programming in the database and presents the solution implemented in the LogicBlox commercial system. The workhorse architectural component is a “meta-engine” that incr...
Cost of Initial Development of PLATO Instruction in Veterinary Medicine. CERL Report X-43.
Grimes, George M.
An academic program instituting the PLATO system of computer-assisted instruction at the University of Illinois College of Veterinary Medicine is discussed. Procedures involved setting up an organization, establishing an administrative system, studying capabilities of the system, studying factors making a lesson suitable for programming, and…
Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C
2016-11-01
Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models.
Using Fuzzy Logic in Test Case Prioritization for Regression Testing Programs with Assertions
Directory of Open Access Journals (Sweden)
Ali M. Alakeel
2014-01-01
Full Text Available Program assertions have been recognized as a supporting tool during software development, testing, and maintenance. Therefore, software developers place assertions within their code in positions that are considered to be error prone or that have the potential to lead to a software crash or failure. Similar to any other software, programs with assertions must be maintained. Depending on the type of modification applied to the modified program, assertions also might have to undergo some modifications. New assertions may also be introduced in the new version of the program, while some assertions can be kept the same. This paper presents a novel approach for test case prioritization during regression testing of programs that have assertions using fuzzy logic. The main objective of this approach is to prioritize the test cases according to their estimated potential in violating a given program assertion. To develop the proposed approach, we utilize fuzzy logic techniques to estimate the effectiveness of a given test case in violating an assertion based on the history of the test cases in previous testing operations. We have conducted a case study in which the proposed approach is applied to various programs, and the results are promising compared to untreated and randomly ordered test cases.
Using fuzzy logic in test case prioritization for regression testing programs with assertions.
Alakeel, Ali M
2014-01-01
Program assertions have been recognized as a supporting tool during software development, testing, and maintenance. Therefore, software developers place assertions within their code in positions that are considered to be error prone or that have the potential to lead to a software crash or failure. Similar to any other software, programs with assertions must be maintained. Depending on the type of modification applied to the modified program, assertions also might have to undergo some modifications. New assertions may also be introduced in the new version of the program, while some assertions can be kept the same. This paper presents a novel approach for test case prioritization during regression testing of programs that have assertions using fuzzy logic. The main objective of this approach is to prioritize the test cases according to their estimated potential in violating a given program assertion. To develop the proposed approach, we utilize fuzzy logic techniques to estimate the effectiveness of a given test case in violating an assertion based on the history of the test cases in previous testing operations. We have conducted a case study in which the proposed approach is applied to various programs, and the results are promising compared to untreated and randomly ordered test cases.
Gervais, Christine; de Montigny, Francine; Lacharité, Carl; Dubeau, Diane
2015-10-01
The transition to fatherhood, with its numerous challenges, has been well documented. Likewise, fathers' relationships with health and social services have also begun to be explored. Yet despite the problems fathers experience in interactions with healthcare services, few programs have been developed for them. To explain this, some authors point to the difficulty practitioners encounter in developing and structuring the theory of programs they are trying to create to promote and support father involvement (Savaya, R., & Waysman, M. (2005). Administration in Social Work, 29(2), 85), even when such theory is key to a program's effectiveness (Chen, H.-T. (2005). Practical program evaluation. Thousand Oaks, CA: Sage Publications). The objective of the present paper is to present a tool, the logic model, to bridge this gap and to equip practitioners for structuring program theory. This paper addresses two questions: (1) What would be a useful instrument for structuring the development of program theory in interventions for fathers? (2) How would the concepts of a father involvement program best be organized? The case of the Father Friendly Initiative within Families (FFIF) program is used to present and illustrate six simple steps for developing a logic model that are based on program theory and demonstrate its relevance.
Standardising the Lay: Logics of Change in Programs of Disease Self-management
Directory of Open Access Journals (Sweden)
Annegrete Juul Nielsen
2012-11-01
Full Text Available The health political discourse on self-care is dominated by the view that the selfmanaging patient represents a more democratic and patient-centric perspective, as he or she is believed to renegotiate the terms on which patient participation in health care has hitherto taken place. The self-managing patient is intended as a challenge to traditional medical authority by introducing lay methods of knowing disease. Rather than a meeting between authoritative professionals and vulnerable patients, the self-managing patient seeks to open up new spaces for a meeting between experts. The present paper questions these assumptions through an ethnographic exploration of a patient-led self-management program called the Chronic Disease Self-Management Program. The program is concerned with what its developers call the social and mental aspects of living with a chronic disease and uses trained patients as role models and program leaders. Drawing inspiration from Annemarie Mol’s term ‘logic’, we explore the rationale of ‘situations of selfmanagement’ and identify what we call a ‘logic of change’, which involves very specific ideas on how life with a chronic condition should be dealt with and directs attention towards particular manageable aspects of life with a chronic condition. This logic of change entails, we argue, a clash not between ‘medical’ and ‘lay’ forms of knowledge but between different logics or perceptions of how transformation can be achieved: through open-ended and ongoing reflection and experimentation in social settings or through standardised trajectories of change. Returning to the literature on lay forms of knowledge and illness perspectives, we question whether programs such as the Chronic Disease Self-Management Program – despite its apparent patient-centric perspective – reproduces classical hierarchical relations between lay and expert knowledge, albeit in new forms.
The Method of Hypothesis in Plato's Philosophy
Directory of Open Access Journals (Sweden)
Malihe Aboie Mehrizi
2016-09-01
Full Text Available The article deals with the examination of method of hypothesis in Plato's philosophy. This method, respectively, will be examined in three dialogues of Meno, Phaedon and Republic in which it is explicitly indicated. It will be shown the process of change of Plato’s attitude towards the position and usage of the method of hypothesis in his realm of philosophy. In Meno, considering the geometry, Plato attempts to introduce a method that can be used in the realm of philosophy. But, ultimately in Republic, Plato’s special attention to the method and its importance in the philosophical investigations, leads him to revise it. Here, finally Plato introduces the particular method of philosophy, i.e., the dialectic
1991-05-31
chip implemen- 0 tation 1601 and the Xenologic X-1, a commercial coprocessor for Sun workstations. Several papers have compared the number of cycles... Xenologic X-I processor 185], an implementation of thc PLM Sarchitecture [28). The BAM code generated for’he same clause is (the pragmas have been...Logic Programs, 5th International Conference and Symposium on Logic Programming. August 1988, pp. 684-699. 85. Xenologic Reasoning System Manual
Satisfiability of logic programming based on radial basis function neural networks
Energy Technology Data Exchange (ETDEWEB)
Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged; Choon, Ong Hong [School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)
2014-07-10
In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.
Satisfiability of logic programming based on radial basis function neural networks
Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged; Choon, Ong Hong
2014-07-01
In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.
Logic, Probability, and Human Reasoning
2015-01-01
3–6] and they underlie mathematics , science, and tech- nology [7–10]. Plato claimed that emotions upset reason - ing. However, individuals in the grip...Press 10 Nickerson, R. (2011) Mathematical Reasoning : Patterns, Problems, Conjectures, and Proofs, Taylor & Francis 11 Blanchette, E. and Richards, A...Logic, probability, and human reasoning P.N. Johnson-Laird1,2, Sangeet S. Khemlani3, and Geoffrey P. Goodwin4 1 Princeton University, Princeton, NJ
THEORY OF LOVE IN PLATO'S PHILOSOPHY
Directory of Open Access Journals (Sweden)
ZOHREH MOZAFARI
2015-01-01
Full Text Available The article presents a philosophical analysis of the phenomenon of Plato’s love. It is noted that a large number of works are devoted to the philosophy of Plato’s love, but not all aspects of his philosophy are studied, for example the problems of erotosophy of Plato. Phenomenon of love interested philosophers since ancient times. The first attempts to explain the phenomenon of love appeared in ancient times. These attempts were made by ancient philosophers Socrates, Plato and Aristotle. Platonism is a multifaceted teaching; identification of all possibilities of Plato’s erotic philosophy which can supplement other fields of philosophy is important and topical.
Guziolowski, Carito; Videla, Santiago; Eduati, Federica; Thiele, Sven; Cokelaer, Thomas; Siegel, Anne; Saez-Rodriguez, Julio
2013-09-15
Logic modeling is a useful tool to study signal transduction across multiple pathways. Logic models can be generated by training a network containing the prior knowledge to phospho-proteomics data. The training can be performed using stochastic optimization procedures, but these are unable to guarantee a global optima or to report the complete family of feasible models. This, however, is essential to provide precise insight in the mechanisms underlaying signal transduction and generate reliable predictions. We propose the use of Answer Set Programming to explore exhaustively the space of feasible logic models. Toward this end, we have developed caspo, an open-source Python package that provides a powerful platform to learn and characterize logic models by leveraging the rich modeling language and solving technologies of Answer Set Programming. We illustrate the usefulness of caspo by revisiting a model of pro-growth and inflammatory pathways in liver cells. We show that, if experimental error is taken into account, there are thousands (11 700) of models compatible with the data. Despite the large number, we can extract structural features from the models, such as links that are always (or never) present or modules that appear in a mutual exclusive fashion. To further characterize this family of models, we investigate the input-output behavior of the models. We find 91 behaviors across the 11 700 models and we suggest new experiments to discriminate among them. Our results underscore the importance of characterizing in a global and exhaustive manner the family of feasible models, with important implications for experimental design. caspo is freely available for download (license GPLv3) and as a web service at http://caspo.genouest.org/. Supplementary materials are available at Bioinformatics online. santiago.videla@irisa.fr.
Rowland, Paula; McMillan, Sarah; McGillicuddy, Patti; Richards, Joy
2017-01-01
Public and patient involvement (PPI) in health care may refer to many different processes, ranging from participating in decision-making about one's own care to participating in health services research, health policy development, or organizational reforms. Across these many forms of public and patient involvement, the conceptual and theoretical underpinnings remain poorly articulated. Instead, most public and patient involvement programs rely on policy initiatives as their conceptual frameworks. This lack of conceptual clarity participates in dilemmas of program design, implementation, and evaluation. This study contributes to the development of theoretical understandings of public and patient involvement. In particular, we focus on the deployment of patient engagement programs within health service organizations. To develop a deeper understanding of the conceptual underpinnings of these programs, we examined the concept of "the patient perspective" as used by patient engagement practitioners and participants. Specifically, we focused on the way this phrase was used in the singular: "the" patient perspective or "the" patient voice. From qualitative analysis of interviews with 20 patient advisers and 6 staff members within a large urban health network in Canada, we argue that "the patient perspective" is referred to as a particular kind of situated knowledge, specifically an embodied knowledge of vulnerability. We draw parallels between this logic of patient perspective and the logic of early feminist theory, including the concepts of standpoint theory and strong objectivity. We suggest that champions of patient engagement may learn much from the way feminist theorists have constructed their arguments and addressed critique.
Quoting Plato in Porphyrius' Cuestiones homericas
Directory of Open Access Journals (Sweden)
Lucía Rodríguez‑Noriega Guillén
2016-08-01
Full Text Available This paper studies the quotations of Plato in Porphyry’s Homeric Questions,including their typology (literal quotation, allusion, paraphrase, etc., their beingor not direct citations, their function in the work, and their possible parallels inother authors.
Plato's problem an introduction to mathematical platonism
Panza, M
2013-01-01
What is mathematics about? And how can we have access to the reality it is supposed to describe? The book tells the story of this problem, first raised by Plato, through the views of Aristotle, Proclus, Kant, Frege, Gödel, Benacerraf, up to the most recent debate on mathematical platonism.
Rauer, H.; et al., [Unknown; Hekker, S.
2014-01-01
PLATO 2.0 has recently been selected for ESA’s M3 launch opportunity (2022/24). Providing accurate key planet parameters (radius, mass, density and age) in statistical numbers, it addresses fundamental questions such as: How do planetary systems form and evolve? Are there other systems with planets
Results of the 1975 Delaware PLATO Project.
Hofstetter, Fred T.
During the Spring semester of 1975, the University of Delaware initiated a PLATO project with the dual purpose of demonstrating how a computer system might function in a university and of evaluating what part such a system might play in the future of the university and its supporting community. The demonstration phase of the project, which…
Socrates, Plato, "Eros" and Liberal Education
McPherran, Mark L.
2010-01-01
This paper focuses on the educational method--the "elenchos"--of Plato's Socrates, arguing, against some prominent interpretations, that it is love, both "eros" and "philia", that is the key that links Socrates' philosophy with his education. This analysis, of course, raises some difficult questions regarding the relationship between teacher and…
Plato's Protagoras: Professional Models, Ethical Concerns.
Gregory, Marshall W.
1983-01-01
In Plato's model his clear criticism of Protagorean careerism and his negotiation with Socratic radicalism shows he is a centrist cultivating criticism and open discourse. In an age when academe seems to have lost a sense of its identify and function in society, its most enduring contributions are criticism and discourse. (MLW)
Quinn, David W.; Quinn, Nancy W.
Apache Junction Unified School District, Arizona, has embarked on a 5-year program of instructional improvement using technology. PLATO Elementary reading and mathematics products were installed in the district's elementary and middle schools at the beginning of the 1999-2000 school year. This evaluation studied the use and preliminary student…
Dynamic Logic with Trace Semantics
Beckert, Bernhard; Bruns, Daniel
2013-01-01
Dynamic logic is an established instrument for program verification and for reasoning about the semantics of programs and programming languages. In this paper, we define an extension of dynamic logic, called Dynamic Trace Logic (DTL), which combines the expressiveness of program logics such as dynamic logic with that of temporal logic. And we present a sound and relatively complete sequent calculus for proving validity of DTL formulae. Due to its expressiveness, DTL can serve as a basis for p...
Recognition of geometric primitives using logic-program and probabilistic-network reasoning methods
Munck-Fairwood, Roger C.
1992-03-01
This paper addresses the issue of recognition of 3-D objects from a potentially very large database of categories of objects, assuming the data are provided in the form of the edges available from a single monocular view, which indicate the discontinuities in depth and surface orientation. The work is partly inspired by the `Recognition by Components' approach suggested fairly recently by Irving Biederman using `geons,' chosen for their qualitatively distinguishable nonmetric viewpoint-invariant properties. The work is also inspired by Richard Gregory's model of human visual recognition which involves probabilistic reasoning, and the regarding of perception as hypothesis. Further, the interpretation of some data can influence the expectation of other data. A novel attempt is made here to apply two automatic reasoning tools to a sub-task of the general recognition process, viz., the recognition of isolated geons in an idealized image. The tools are logic programming and `belief networks' (causal probabilistic networks). Both the tools have the important property of allowing propagation of information in both directions, i.e., data to hypotheses, and vice-versa. The results to date show good patterns of reasoning consistent with one's intuition and point to the possibility of appropriately `tuning' some feature detectors according to other data received. Future goals include the recognition of geons from real gray-level image data, the extension of the belief network to composite objects, and the use of a reverse-driven image analysis logic program to generate graphics and thereby identify appropriate model constraints.
Exploratory Analysis of the Social Network of Researchers in Inductive Logic Programming
Lavrač, Nada; Grčar, Miha; Fortuna, Blaž; Velardi, Paola
In this chapter, we present selected techniques for social network analysis and text mining and interpret the results of exploratory analysis of the social network of researchers in inductive logic programming (ILP), based on the ILP scientific publications database collected within the ILPnet2 project. Part of the analysis was performed with the Pajek software for large (social) network analyses, where the central entity of the analysis was the author, related to other authors by coauthorship links, weighted by the number of his or her publications registered in the ILPnet2 database. The chapter presents also a novel methodology for topic ontology learning from text documents. The proposed methodology, named OntoTermExtraction (Term Extraction for Ontology learning), is based on OntoGen, a semiautomated tool for topic ontology construction, upgraded by using an advanced terminology extraction tool in an iterative, semiautomated ontology construction process. The approach was successfully used for generating the ontology of topics in Inductive Logic Programming, learned semiautomatically from papers indexed in the ILPnet2 publications database.
Radiation, Thermal Gradient and Weight: a threefold dilemma for PLATO
Magrin, Demetrio; Ragazzoni, Roberto; Bruno, Giordano; Piazza, Daniele; Borsa, Francesco; Ghigo, Mauro; Mogulsky, Valery; Bergomi, Maria; Biondi, Federico; Chinellato, Simonetta; Dima, Marco; Farinato, Jacopo; Greggio, Davide; Gullieuszik, Marco; Marafatto, Luca; Viotto, Valentina; Munari, Matteo; Pagano, Isabella; Sicilia, Daniela; Basso, Stefano; Spiga, Daniele; Bandy, Timothy; Brändli, Mathias; Benz, Willy; De Roche, Thierry; Rieder, Martin; Brandeker, Alexis; Klebor, Maximilian; Schweitzer, Mario; Wieser, Matthias; Erikson, Anders; Rauer, Heike
2016-07-01
The project PLAnetary Transits and Oscillations of stars (PLATO) is one of the selected medium class (M class) missions in the framework of the ESA Cosmic Vision 2015-2025 program. The mean scientific goal of PLATO is the discovery and study of extrasolar planetary systems by means of planetary transits detection. The opto mechanical subsystem of the payload is made of 32 normal telescope optical units (N-TOUs) and 2 fast telescope optical units (FTOUs). The optical configuration of each TOU is an all refractive design based on six properly optimized lenses. In the current baseline, in front of each TOU a Suprasil window is foreseen. The main purposes of the entrance window are to shield the following lenses from possible damaging high energy radiation and to mitigate the thermal gradient that the first optical element will experience during the launch from ground to space environment. In contrast, the presence of the window increases the overall mass by a non-negligible quantity. We describe here the radiation and thermal analysis and their impact on the quality and risks assessment, summarizing the trade-off process with pro and cons on having or dropping the entrance window in the optical train.
Manufacturing and alignment tolerance analysis through Montecarlo approach for PLATO
Magrin, Demetrio; Ragazzoni, Roberto; Bergomi, Maria; Biondi, Federico; Chinellato, Simonetta; Dima, Marco; Farinato, Jacopo; Greggio, Davide; Gullieuszik, Marco; Marafatto, Luca; Viotto, Valentina; Munari, Matteo; Pagano, Isabella; Sicilia, Daniela; Basso, Stefano; Borsa, Francesco; Ghigo, Mauro; Spiga, Daniele; Bandy, Timothy; Brändli, Mathias; Benz, Willy; Bruno, Giordano; De Roche, Thierry; Piazza, Daniele; Rieder, Martin; Brandeker, Alexis; Klebor, Maximilian; Mogulsky, Valery; Schweitzer, Mario; Wieser, Matthias; Erikson, Anders; Rauer, Heike
2016-07-01
The project PLAnetary Transits and Oscillations of stars (PLATO) is one of the selected medium class (M class) missions in the framework of the ESA Cosmic Vision 2015-2025 program. The main scientific goal of PLATO is the discovery and study of extrasolar planetary systems by means of planetary transits detection. According to the current baseline, the scientific payload consists of 34 all refractive telescopes having small aperture (120mm) and wide field of view (diameter greater than 37 degrees) observing over 0.5-1 micron wavelength band. The telescopes are mounted on a common optical bench and are divided in four families of eight telescopes with an overlapping line-of-sight in order to maximize the science return. Remaining two telescopes will be dedicated to support on-board star-tracking system and will be specialized on two different photometric bands for science purposes. The performance requirement, adopted as merit function during the analysis, is specified as 90% enclosed energy contained in a square having size 2 pixels over the whole field of view with a depth of focus of +/-20 micron. Given the complexity of the system, we have followed a Montecarlo analysis approach for manufacturing and alignment tolerances. We will describe here the tolerance method and the preliminary results, speculating on the assumed risks and expected performances.
Directory of Open Access Journals (Sweden)
Kody M. Powell
2016-03-01
Full Text Available This work presents a methodology to represent logical decisions in differential algebraic equation simulation and constrained optimization problems using a set of continuous algebraic equations. The formulations may be used when state variables trigger a change in process dynamics, and introduces a pseudo-binary decision variable, which is continuous, but should only have valid solutions at values of either zero or one within a finite time horizon. This formulation enables dynamic optimization problems with logical disjunctions to be solved by simultaneous solution methods without using methods such as mixed integer programming. Several case studies are given to illustrate the value of this methodology including nonlinear model predictive control of a chemical reactor using a surge tank with overflow to buffer disturbances in feed flow rate. Although this work contains novel methodologies for solving dynamic algebraic equation (DAE constrained problems where the system may experience an abrupt change in dynamics that may otherwise require a conditional statement, there remain substantial limitations to this methodology, including a limited domain where problems may converge and the possibility for ill-conditioning. Although the problems presented use only continuous algebraic equations, the formulation has inherent non-smoothness. Hence, these problems must be solved with care and only in select circumstances, such as in simulation or situations when the solution is expected to be near the solver’s initial point.
Buttingsrud, Bård; Ryeng, Einar; King, Ross D; Alsberg, Bjørn K
2006-06-01
The requirement of aligning each individual molecule in a data set severely limits the type of molecules which can be analysed with traditional structure activity relationship (SAR) methods. A method which solves this problem by using relations between objects is inductive logic programming (ILP). Another advantage of this methodology is its ability to include background knowledge as 1st-order logic. However, previous molecular ILP representations have not been effective in describing the electronic structure of molecules. We present a more unified and comprehensive representation based on Richard Bader's quantum topological atoms in molecules (AIM) theory where critical points in the electron density are connected through a network. AIM theory provides a wealth of chemical information about individual atoms and their bond connections enabling a more flexible and chemically relevant representation. To obtain even more relevant rules with higher coverage, we apply manual postprocessing and interpretation of ILP rules. We have tested the usefulness of the new representation in SAR modelling on classifying compounds of low/high mutagenicity and on a set of factor Xa inhibitors of high and low affinity.
Energy Technology Data Exchange (ETDEWEB)
Wos, L.; McCune, W.
1988-01-01
In this paper, we offer a set of problems for evaluating the power of automated theorem-proving programs and the potential of new ideas. Since the problems published in the proceedings of the first CADE conference proved to be so useful, and since researchers are now far more disposed to implementing and testing their ideas, a new set of problems to complement those that have been widely studied is in order. In general, the new problems provide a far greater challenge for an automated theorem-proving program than those in the first set do. Indeed, to our knowledge, five of the six problems we propose for study have never been proved with a theorem-proving program. For each problem, we give a set of statements that can easily be translated into a standard set of clauses. We also state each problem in its mathematical and logical form. In many cases, we also provide a proof of the theorem from which a problem is taken so that one can measure a program's progress in its attempt to solve the problem. Two of the theorems we discuss are of especial interest in that they answer questions that had been open concerning the constructibility of two types of combinator. We also include a brief description of a new strategy for restricting the application of paramodulation. All of the problems we propose for study emphasize the role of equality. This paper is tutorial in nature.
Hommel, G; Bernhard, G
1994-06-01
It is demonstrated how improvements of general multiple test procedures can be obtained using information about the logical structures among the hypotheses. Based on a procedure of Bergmann and Hommel (B. Bergmann and G. Hommel, Improvements of general multiple test procedures for redundant systems of hypotheses, in Multiple Hypothesenprüfung--Multiple Hypotheses Testing, Eds. P. Bauer, G. Hommel and E. Sonnemann, pp. 100-115 (Springer-Verlag, Berlin, 1988)), a computer program was written by Bernhard (G. Bernhard, Computerunterstützte Durchführung von multiplen Testprozeduren--Algorithmen und Powervergleich, Doctoral thesis (Mainz, 1992)) using this information. It is applicable for a general class of systems of hypotheses which can be expressed in a linear way. By means of a simulation study it is shown that the proposed procedure is often substantially more powerful than other usual multiple test procedures.
Identification of Tumor Evolution Patterns by Means of Inductive Logic Programming
Institute of Scientific and Technical Information of China (English)
Vitoantonio Bevilacqua; Patrizia Chiarappa; Giuseppe Mastronardi; Filippo Menolascina; Angelo Paradiso; Stefania Tommasi
2008-01-01
In considering key events of genomic disorders in the development and progression of cancer, the correlation between genomic instability and carcinogenesis is currently under investigation. In this work, we propose an inductive logic programming approach to the problem of modeling evolution patterns for breast cancer. Using this approach, it is possible to extract fingerprints of stages of the disease that can be used in order to develop and deliver the most adequate therapies to patients. Furthermore, such a model can help physicians and biologists in the elucidation of molecular dynamics underlying the aberrations-waterfall model behind carcinogenesis. By showing results obtained on a real-world dataset, we try to give some hints about further approach to the knowledge-driven validations of such hypotheses.
Sherman, Paul David
2016-04-01
This article presents a framework to identify key mechanisms for developing a logic model blueprint that can be used for an impending comprehensive evaluation of an undergraduate degree program in a Canadian university. The evaluation is a requirement of a comprehensive quality assurance process mandated by the university. A modified RUFDATA (Saunders, 2000) evaluation model is applied as an initiating framework to assist in decision making to provide a guide for conceptualizing a logic model for the quality assurance process. This article will show how an educational evaluation is strengthened by employing a RUFDATA reflective process in exploring key elements of the evaluation process, and then translating this information into a logic model format that could serve to offer a more focussed pathway for the quality assurance activities. Using preliminary program evaluation data from two key stakeholders of the undergraduate program as well as an audit of the curriculum's course syllabi, a case is made for, (1) the importance of inclusivity of key stakeholders participation in the design of the evaluation process to enrich the authenticity and accuracy of program participants' feedback, and (2) the diversification of data collection methods to ensure that stakeholders' narrative feedback is given ample exposure. It is suggested that the modified RUFDATA/logic model framework be applied to all academic programs at the university undergoing the quality assurance process at the same time so that economies of scale may be realized.
DEFF Research Database (Denmark)
Poulsen, Kåre Harbo; Pop, Paul; Izosimov, Viacheslav
2007-01-01
We present a constraint logic programming (CLP) approach for synthesis of fault-tolerant hard real-time applications on distributed heterogeneous architectures. We address time-triggered systems, where processes and messages are statically scheduled based on schedule tables. We use process re...
Ziviani, Jenny; Feeney, Rachel; Schabrun, Siobhan; Copland, David; Hodges, Paul
2014-08-01
The purpose of this study was to present the application of a logic model in depicting the underlying theory of an undergraduate research scheme for occupational therapy, physiotherapy, and speech pathology university students in Queensland, Australia. Data gathered from key written documents on the goals and intended operation of the research incubator scheme were used to create a draft (unverified) logic model. The major components of the logic model were inputs and resources, activities/outputs, and outcomes (immediate/learning, intermediate/action, and longer term/impacts). Although immediate and intermediate outcomes chiefly pertained to students' participation in honours programs, longer-term outcomes (impacts) concerned their subsequent participation in research higher-degree programs and engagement in research careers. Program logic provided an effective means of clarifying program objectives and the mechanisms by which the research incubator scheme was designed to achieve its intended outcomes. This model was developed as the basis for evaluation of the effectiveness of the scheme in achieving its stated goals.
Hamilton, Jenny; Bronte-Tinkew, Jacinta
2007-01-01
A logic model, also called a conceptual model and theory-of-change model, is a visual representation of how a program is expected to "work." It relates resources, activities, and the intended changes or impacts that a program is expected to create. Typically, logic models are diagrams or flow charts with illustrations, text, and arrows that…
From Plato to Orwell: Utopian Rhetoric in a Dystopian World.
Deatherage, Scott
Plato's "Republic" and George Orwell's "1984" both posit visionary worlds, one where humans are virtuous and understand what Plato refers to as "the Good," and the other where citizens are pawns of a government which uses language as a form of tyranny and control. Despite these overarching differences in philosophical…
From Plato to Orwell: Utopian Rhetoric in a Dystopian World.
Deatherage, Scott
Plato's "Republic" and George Orwell's "1984" both posit visionary worlds, one where humans are virtuous and understand what Plato refers to as "the Good," and the other where citizens are pawns of a government which uses language as a form of tyranny and control. Despite these overarching differences in philosophical…
Plato the Pederast: Rhetoric and Cultural Procreation in the Dialogues.
Ervin, Elizabeth
1993-01-01
Examines Plato's Dialogues by reading them through two cultural lenses: the role of eros in classical Greece and its analogous relationship to language and rhetoric; and the educational function of eros within the ancient institution of pederasty. Shows how the cultural values of ancient Greece manifested themselves in Plato's erotic educational…
Plato's Philosophy of Education and the Common Core Debate
Murphy, Madonna M.
2015-01-01
This paper examines Plato's Philosophy of Education asking what he would say about the current Common Core initiative which is to better help students to become college and career ready. Plato would be in favor of the common core in as much as the standards are tied to specific skills needed in various career jobs as he was a proponent of…
Fourth Summative Report of the Delaware PLATO Project.
Hofstetter, Fred T.
A brief history of the Delaware PLATO project and descriptions of new developments in facilities, applications, user services, research, evaluation, and courseware produced since the Third Summative Report (1978) are provided, as well as an overview of PLATO applications at the University of Delaware. Sample lessons, illustrations, and activity…
Fifth Summative Report of the Delaware PLATO Project.
Hofstetter, Fred T.
A brief history of the Delaware PLATO project and descriptions of the new developments in facilities, applications, user services, research, evaluation, and courseware produced since the Fourth Summative Report (1979) are provided, as well as an overview of PLATO applications at the University of Delaware. Sample lessons, illustrations, and…
Third Summative Report of the Delaware PLATO Project.
Hofstetter, Fred T.
Descriptions of new developments in the areas of facilities, applications, user services, support staff, research, evaluation, and courseware production since the Second Summative Report (1977) are provided, as well as a summative overview of PLATO applications at the University of Delaware. Through the purchase of its own PLATO system, this…
The Structure and Semantics of an Object—Oriented Logic Programming Language：SCKE
Institute of Scientific and Technical Information of China (English)
金芝
1995-01-01
The development of the object-oriented paradigm has suffered from the lack of any generally accepted formal foundations for its semantic definition.To address this issue,we propose the development of the logic-based semantics of the object-oriented paradigm.By combining the logic-with the object-oriented paradigm of computing first,this paper discusses formally the semantics of a quite purely object-oriented logic paradigm in terms of proof theory,model theory and fixpoint theory from the viewpoint of logic.The operational and declarative semantics is given.And then the correspondence between soundness and completeness has been discussed formally.
Plato's ghost the modernist transformation of mathematics
Gray, Jeremy
2008-01-01
Plato's Ghost is the first book to examine the development of mathematics from 1880 to 1920 as a modernist transformation similar to those in art, literature, and music. Jeremy Gray traces the growth of mathematical modernism from its roots in problem solving and theory to its interactions with physics, philosophy, theology, psychology, and ideas about real and artificial languages. He shows how mathematics was popularized, and explains how mathematical modernism not only gave expression to the work of mathematicians and the professional image they sought to create for themselves, but how modernism also introduced deeper and ultimately unanswerable questions
Pemikiran Epistemologi Barat: dari Plato Sampai Gonseth
Directory of Open Access Journals (Sweden)
Nunu Burhanuddin
2015-06-01
Full Text Available This paper riviewing the Western epistemology thought. The theme focuses on Plato to Gonseth. The Epistemology that referred in this article, is to think about "how humans acquire knowledge?". From this then appear four types of sect modern western epistemology thought, namely: sect of empiricism, rationalism sect, kantinian sect, sect of positivism. Furthermore, the social positivism sciences developed by Comte leaves serious problems associated with the loss of the role of the subject. This problem being the background of epistemology philosophy appears that by Emund Husserl developed through the phenomenology, Habermas through hermeneutics, and Ferdinand Gonseth through critical theory.
Relational Parametricity and Separation Logic
DEFF Research Database (Denmark)
Birkedal, Lars; Yang, Hongseok
2008-01-01
Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types. Our interpretation is based on Reynolds's relational...... parametricity, and it provides a formal connection between separation logic and data abstraction. Udgivelsesdato: 2008...
Fuzzy logic controller approach in quality and productivity improvement program (PPKP)
Ruza, Nadiah; Mustafa, Zainol; Rika Fatimah, P. L.; Hussain, Saiful Izzuan
2013-04-01
The education sector plays a major role in building the stability and strength of a country and also the main channel in shaping the quality of nation. Each generation have different educational level. Therefore, improvements should be made on an on-going basis to ensure that quality of education is at high level all the time. In general, this study aimed to determine the effectiveness of the education system for Quality and Productivity Improvement Program (PPKP), Universiti Kebangsaan Malaysia (UKM) from the perspective of alumni as well as their satisfaction and importance level on how PPKP be able to meet the needs of their students. This study discusses the application of Fuzzy Logic Control analysis, which is flexible and adjustable. This analysis also identifies the program's quality of education system through alumni point of view. Overall, it was found that 93.4 percent of respondents felt that all four dimensions of students' needs have high level of importance. The rest felt that the importance level of all four dimensions is modest. Next, in term of satisfaction level with PPKP, only one percent was very satisfied with PPKP's role in meeting the needs of students and the rest felt that their needs are met only at moderate level. Results of this study could be used to improve the quality of education system for PPKP.
Rauer, H; Aerts, C; Appourchaux, T; Benz, W; Brandeker, A; Christensen-Dalsgaard, J; Deleuil, M; Gizon, L; Güdel, M; Janot-Pacheco, E; Mas-Hesse, M; Pagano, I; Piotto, G; Pollacco, D; Santos, N C; Smith, A; -C., J; Suárez,; Szabó, R; Udry, S; Adibekyan, V; Alibert, Y; Almenara, J -M; Amaro-Seoane, P; Eiff, M Ammler-von; Antonello, E; Ball, W; Barnes, S; Baudin, F; Belkacem, K; Bergemann, M; Birch, A; Boisse, I; Bonomo, A S; Borsa, F; Brandão, I M; Brocato, E; Brun, S; Burleigh, M; Burston, R; Cabrera, J; Cassisi, S; Chaplin, W; Charpinet, S; Chiappini, C; Csizmadia, Sz; Cunha, M; Damasso, M; Davies, M B; Deeg, H J; Fialho, F de Oliveira; DÍaz, R F; Dreizler, S; Dreyer, C; Eggenberger, P; Ehrenreich, D; Eigmüller, P; Erikson, A; Farmer, R; Feltzing, S; Figueira, P; Forveille, T; Fridlund, M; García, R; Giuffrida, G; Godolt, M; da Silva, J Gomes; Goupil, M -J; Granzer, T; Grenfell, J L; Grotsch-Noels, A; Günther, E; Haswell, C A; Hatzes, A P; Hébrard, G; Hekker, S; Helled, R; Heng, K; Jenkins, J M; Khodachenko, M L; Kislyakova, K G; Kley, W; Kolb, U; Krivova, N; Kupka, F; Lammer, H; Lanza, A F; Lebreton, Y; Magrin, D; Marcos-Arenal, P; Marrese, P M; Marques, J P; Martins, J; Mathis, S; Mathur, S; Messina, S; Miglio, A; Montalban, J; Montalto, M; Monteiro, M J P F G; Moradi, H; Moravveji, E; Mordasini, C; Morel, T; Mortier, A; Nascimbeni, V; Nielsen, M B; Noack, L; Norton, A J; Ofir, A; Oshagh, M; Ouazzani, R -M; Pápics, P; Parro, V C; Petit, P; Plez, B; Poretti, E; Quirrenbach, A; Ragazzoni, R; Raimondo, G; Rainer, M; Reese, D R; Redmer, R; Reffert, S; Rojas-Ayala, B; Roxburgh, I W; Solanki, S K; Salmon, S; Santerne, A; Schneider, J; Schou, J; Schuh, S; Schunker, H; Silva-Valio, A; Silvotti, R; Skillen, I; Snellen, I; Sohl, F; Sousa, A S; Sozzetti, A; Stello, D; Strassmeier, K G; Švanda, M; Szabó, G M; Tkachenko, A; Valencia, D; van Grootel, V; Vauclair, S D; Ventura, P; Wagner, F W; Walton, N A; Weingrill, J; Werner, S C; Wheatley, P J; Zwintz, K
2013-01-01
PLATO 2.0 is a mission candidate for ESA's M3 launch opportunity (2022/24). It addresses fundamental questions such as: How do planetary systems form and evolve? Are there other systems with planets like ours, able to develop life? The PLATO 2.0 instrument consists of 34 small aperture telescopes providing a wide field-of-view and a large photometric magnitude range. It targets bright stars in wide fields to detect and characterize planets down to Earth-size by photometric transits, whose masses can then be determined by ground-based radial-velocity follow-up measurements. Asteroseismology will be performed for stars <=11mag to obtain highly accurate stellar parameters, including masses and ages. The combination of bright targets and asteroseismology results in high accuracy for the bulk planet parameters: 2%, 4-10% and 10% for planet radii, masses and ages, respectively. The foreseen baseline observing strategy includes two long pointings (2-3 years) to detect and bulk characterize planets reaching into t...
Discovering H-bonding rules in crystals with inductive logic programming.
Ando, Howard Y; Dehaspe, Luc; Luyten, Walter; Van Craenenbroeck, Elke; Vandecasteele, Henk; Van Meervelt, Luc
2006-01-01
In the domain of crystal engineering, various schemes have been proposed for the classification of hydrogen bonding (H-bonding) patterns observed in 3D crystal structures. In this study, the aim is to complement these schemes with rules that predict H-bonding in crystals from 2D structural information only. Modern computational power and the advances in inductive logic programming (ILP) can now provide computational chemistry with the opportunity for extracting structure-specific rules from large databases that can be incorporated into expert systems. ILP technology is here applied to H-bonding in crystals to develop a self-extracting expert system utilizing data in the Cambridge Structural Database of small molecule crystal structures. A clear increase in performance was observed when the ILP system DMax was allowed to refer to the local structural environment of the possible H-bond donor/acceptor pairs. This ability distinguishes ILP from more traditional approaches that build rules on the basis of global molecular properties.
Schmidt, David; Kurtz, Megan; Davidson, Stuart
2017-01-01
District advisors in five allied health disciplines were introduced in a local health district in rural Australia in 2013. These strategic leadership roles provide support to clinicians and managers. As there is little research exploring allied health leadership models from a strategic and operational perspective, the coordinated commencement of these roles provided opportunity to study the creation of this leadership structure. Four advisors participated in this action research study which used focus groups and program logic processes to explore the inputs, outputs, barriers, outcomes to date, and preferred future outcomes of the leadership model. A purpose-built questionnaire was sent to 134 allied health clinicians or managers with questionnaire responses used by advisors to visualise the leadership model. Advisors prioritised policy development, representing the profession outside the organisation, and supporting department managers, whilst clinicians prioritised communication and connection-building within the organisation. Outcomes of the leadership model included connection, coordination, and advocacy for clinicians. Future preferred outcomes included increased strategic and workforce planning. Barriers included limited time, a widespread workforce and limited resourcing. Instituting a leadership model improved communication, cohesion, and coordination within the organisation. Future increases in workforce planning and coordination are limited by advisor capacity and competing workloads.
West, Joseph F
2014-02-01
Diabetes remains a growing epidemic with widening health inequity gaps in disease management, self-management knowledge, access to care and outcomes. Yet there is a paucity of evaluation tools for community engaged interventions aimed at closing the gaps and improving health. The Guide to Community Preventive Services (the Community Guide) developed by the Task Force on Community Preventive Services (the Task Force) at the Centers for Disease Control and Prevention (CDC) recommends two healthcare system level interventions, case management interventions and disease management programs, to improve glycemic control. However, as a public health resource guide for diabetes interventions a model for community engagement is a glaringly absent component of the Community Guide recommendations. In large part there are few evidence-based interventions featuring community engagement as a practice and system-level focus of chronic disease and Type 2 diabetes management. The central argument presented in this paper is that the absence of these types of interventions is due to the lack of tools for modeling and evaluating such interventions, especially among disparate and poor populations. A conceptual model emphasizing action-oriented micro-level community engagement is needed to complement the Community Guide and serve as the basis for testing and evaluation of these kinds of interventions. A unique logic model advancing the Community Guide diabetes recommendations toward measureable and sustainable community engagement for improved Type 2 diabetes outcomes is presented. Copyright © 2013 Elsevier Ltd. All rights reserved.
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students......A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students...
Plato on Metaphysical Explanation: Does 'Participating' Mean Nothing?
Directory of Open Access Journals (Sweden)
Christine J. Thomas
2014-12-01
Full Text Available According to Aristotle, Plato's efforts at metaphysical explanation not only fail, they are nonsensical. In particular, Plato's appeals to Forms as metaphysically explanatory of the sensibles that participate in them is "empty talk" since "'participating' means nothing" (Met. 992a28-9. I defend Plato against Aristotle's charge by identifying a particular, substantive model of metaphysical predication as the favored model of Plato's late ontology. The model posits two basic metaphysical predication relations: self-predication and participation. In order to understand the participation relation, it is important first to understand how Plato's Forms are self-predicative paradigms. According to the favored model, Forms are self-predicative paradigms insofar as they are ideal, abstract encoders of structural essences. Sensibles participate in Forms by exemplifying the structures encoded in the Forms. Given plausible conditions on metaphysical explanation, Plato's appeals to abstract Forms as metaphysically explanatory of sensibles is a reasonable competitor for Aristotle's appeals to natural, substantial forms. At the very least, Plato's appeals to a participation relation are not empty.
Institute of Scientific and Technical Information of China (English)
林作铨
1996-01-01
A modal nonmonotonic logic is presented based on an experiential modal semantics on typicality and exception.The syntactic and semantics of modal nonmonotonic logic are provided,and the completeness theorem and the theorems relating it to major nonmonotonic logics are proved.It directly formalizes the intuition of nonmonotonic reasoning.Among other things,it provides us a first-order extension of default logic and autoepistemic logic,and simultaneously has the capability of circumscription to infer universal statement.It has important applications in logic programming and deductive data base.As a result,it provides a uniform basis for various nonmonotonic logics,from which the correspondent relationship among major nonmonotonic logics can coincide.
Technology validation of the PLATO CCD at ESA
Prod'homme, Thibaut; Verhoeve, Peter; Beaufort, Thierry; Duvet, Ludovic; Lemmel, Frederic; Smit, Hans; Blommaert, Sander; Oosterbroek, Tim; van der Luijt, Cornelis; Visser, Ivo; Heijnen, Jerko; Butler, Bart
2016-07-01
PLATO { PLAnetary Transits and Oscillations of stars { is the third medium-class mission to be selected in the European Space Agency (ESA) Science and Robotic Exploration Cosmic Vision programme. Due for launch in 2025, the payload makes use of a large format (8 cm x 8 cm) Charge-Coupled Devices (CCDs) the e2v CCD270 operated at 4 MHz. The manufacture of such large device in large quantity constitutes an unprecedented effort. To de-risk the PLATO CCD procurement and aid the mission definition process, ESA's Payload Technology Validation team is characterizing the electro-optical performance of a number of PLATO devices before and after proton irradiation.
A scientific approach to Plato's Atlantis
Directory of Open Access Journals (Sweden)
Massimo Rapisarda
2015-09-01
Full Text Available The myth of Atlantis is hard to die. This attempt to use scientific evidence to give it the final smash ends up with the doubt that it might not be totally unsubstantiated. The time of the supposed existence of Atlantis (around twelve thousand years ago was, in fact, characterized by technological revolutions, acknowledged by archaeology, and abrupt climate changes, documented by geology. In principle, it cannot therefore be ruled out that some of those dramatic events left a memory, later used by Plato as a basis for its tale. The climate changes involved the majority of the northern hemisphere, thus all the ancient civilizations (Egyptian, Mesopotamian, Indian and Chinese could have preserved reminiscence, but it is clear that the events occurring closer to Greece would have been more accessible to Plato. Among the Mediterranean sites that experienced the cataclysms of the beginning of the Holocene, a good candidate to host a primordial civilization might have been the archipelago then existing in the Strait of Sicily, a natural maritime link between Tunisia and Italy, prized by the presence of an obsidian source at Pantelleria. Eleven thousand five hundred years ago, a sudden sea level rise erased the archipelago, submerging the possible settlements, but Pantelleria obsidian ores are still there and could provide a significant clue. In fact, the potential discovery of artefacts, originating from a source now submerged by the sea level rise, would imply that the collection of the mineral took place when it was still emerged, namely at the time of Atlantis. Even if such discovery would not be sufficient to prove the existence of the mythical island, it would be enough to shake up the timeline of the human occupation in the region.
Intra-Socratic Polemics: The Symposia of Plato and Xenophon
Directory of Open Access Journals (Sweden)
Gabriel Danzig
2010-11-01
Full Text Available Textual relationships between the two Symposia suggest that Xenophon wrote first, prompting Plato to write Socrates' critique of Phaedrus, to which Xenophon responded by appending his ch. 8.
Rationality and Motivation: Moral Psychology in Plato's Socratic Dialogues
Ivars Neiders
2011-01-01
"Rationality and Motivation: Moral Psychology in Plato's Socratic Dialogues" Annotation The dissertation "Rationality and Motivation: Moral Psychology in Plato's Socratic Dialogues" is a philosophical study of Socratic views in moral psychology. Particular attention is paid to what the author calls (1) Doxastic competence and (2) Orectic competence. It is argued that according to Socrates these two different epistemic relations are important aspects of our self-understanding. The doxast...
The instrument control unit of the ESA-PLATO 2.0 mission
Focardi, M.; Pezzuto, S.; Cosentino, R.; Giusi, G.; Pancrazzi, M.; Noce, V.; Ottensamer, R.; Steller, M.; Di Giorgio, A. M.; Pace, E.; Plasson, P.; Peter, G.; Pagano, I.
2016-07-01
PLATO 2.0 has been selected by ESA as the third medium-class Mission (M3) of the Cosmic Vision Program. Its Payload is conceived for the discovery of new transiting exoplanets on the disk of their parent stars and for the study of planetary system formation and evolution as well as to answer fundamental questions concerning the existence of other planetary systems like our own, including the presence of potentially habitable new worlds. The PLATO Payload design is based on the adoption of four sets of short focal length telescopes having a large field of view in order to exploit a large sky coverage and to reach, at the same time, the needed photometry accuracy and signalto- noise ratio (S/N) within a few tens of seconds of exposure time. The large amount of data produced by the telescope is collected and processed by means of the Payload's Data Processing System (DPS) composed by many processing electronics units. This paper gives an overview of the PLATO 2.0 DPS, mainly focusing on the architecture and processing capabilities of its Instrument Control Unit (ICU), the electronic subsystem acting as the main interface between the Payload (P/L) and the Spacecraft (S/C).
Fink, Michael
2010-01-01
Different notions of equivalence, such as the prominent notions of strong and uniform equivalence, have been studied in Answer-Set Programming, mainly for the purpose of identifying programs that can serve as substitutes without altering the semantics, for instance in program optimization. Such semantic comparisons are usually characterized by various selections of models in the logic of Here-and-There (HT). For uniform equivalence however, correct characterizations in terms of HT-models can only be obtained for finite theories, respectively programs. In this article, we show that a selection of countermodels in HT captures uniform equivalence also for infinite theories. This result is turned into coherent characterizations of the different notions of equivalence by countermodels, as well as by a mixture of HT-models and countermodels (so-called equivalence interpretations). Moreover, we generalize the so-called notion of relativized hyperequivalence for programs to propositional theories, and apply the same ...
Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming
Lisi, Francesca A.
2007-01-01
Building rules on top of ontologies is the ultimate goal of the logical layer of the Semantic Web. To this aim an ad-hoc mark-up language for this layer is currently under discussion. It is intended to follow the tradition of hybrid knowledge representation and reasoning systems such as $\\mathcal{AL}$-log that integrates the description logic $\\mathcal{ALC}$ and the function-free Horn clausal language \\textsc{Datalog}. In this paper we consider the problem of automating the acquisition of the...
What Plato and Murdoch Think About Love
Directory of Open Access Journals (Sweden)
Shadi Shakouri
2012-07-01
Full Text Available There are many interpretations of love and lots of scholars write and talk on love; however, what exactly is the meaning of love? Iris Murdoch’s works are an accumulation of emotional relationships and feelings of love. Her great subject is love, both sexual and non-sexual, and her characters are the portrayal of a small group of people caught up in convoluted ties of love and hate, with Eros ruling over them (Cohen 22. Murdoch was one of the most respected British writers and philosophers of the second half of the twentieth century and, of course, the postwar period. In Murdoch’s novels, love is one of the central themes—marriage, as the institution of love, more often binds than frees. Her characters are mainly ego-centric people who struggle to love and are often overwhelmed by the factor of self-obsession, jealousy, ambition, fascination with suffering and charismatic power. They are absolutely ordinary people with a consuming demand for love, and mental and physical exile. Murdoch was inspired by Plato’s ideas in many ways. Like art, here again Plato’s idea of love is more skeptical than Murdoch’s, whereas Murdoch kept it only as a way to the Good, creation, and happiness. Murdoch and Plato saw love more as a Freudian concept, the Eros, the word that comes from the name of the first Greek god of love. Both the philosophers, Plato and Murdoch, believed that this erotic longing and desires revived by Eros can led to a new direction, a way toward virtue and truth. Her protagonist or marginalized characters are usually tackling it with either vulgarity or the heavenly, which results in creation, art or salvation. Murdoch, as a major moral philosopher, usually grasps the chances to encapsulate her moral visions in her works, and created novels that should be counted as meditations on human love and goodness. Keywords: Eros, erotic love and real artwork, moral philosopher, The Black Prince
Howard, Ayanna
2005-01-01
The Fuzzy Logic Engine is a software package that enables users to embed fuzzy-logic modules into their application programs. Fuzzy logic is useful as a means of formulating human expert knowledge and translating it into software to solve problems. Fuzzy logic provides flexibility for modeling relationships between input and output information and is distinguished by its robustness with respect to noise and variations in system parameters. In addition, linguistic fuzzy sets and conditional statements allow systems to make decisions based on imprecise and incomplete information. The user of the Fuzzy Logic Engine need not be an expert in fuzzy logic: it suffices to have a basic understanding of how linguistic rules can be applied to the user's problem. The Fuzzy Logic Engine is divided into two modules: (1) a graphical-interface software tool for creating linguistic fuzzy sets and conditional statements and (2) a fuzzy-logic software library for embedding fuzzy processing capability into current application programs. The graphical- interface tool was developed using the Tcl/Tk programming language. The fuzzy-logic software library was written in the C programming language.
A DNAzyme-mediated logic gate for programming molecular capture and release on DNA origami.
Li, Feiran; Chen, Haorong; Pan, Jing; Cha, Tae-Gon; Medintz, Igor L; Choi, Jong Hyun
2016-06-28
Here we design a DNA origami-based site-specific molecular capture and release platform operated by a DNAzyme-mediated logic gate process. We show the programmability and versatility of this platform with small molecules, proteins, and nanoparticles, which may also be controlled by external light signals.
Perréard, S
1993-01-01
Many processes are controlled by experts using some kind of mental model to decide actions and make conclusions. This model, based on heuristic knowledge, can often be conveniently represented in rules and has not to be particularly accurate. This is the case for the problem of conditioning high voltage radio-frequency cavities: the expert has to decide, by observing some criteria, if he can increase or if he has to decrease the voltage and by how much. A program has been implemented which can be applied to a class of similar problems. The kernel of the program is a small rule base, which is independent of the kind of cavity. To model a specific cavity, we use fuzzy logic which is implemented as a separate routine called by the rule base. We use fuzzy logic to translate from numeric to symbolic information. The example we chose for applying this kind of technique can be implemented by sequential programming. The two versions exist for comparison. However, we believe that this kind of programming can be powerf...
The Role of PROLOG (PROgramming and LOGic) in Natural Language Processing.
1988-03-01
14 5. Bottom Up Parser (BUP) ... ......... . 19 6. Modular Logic Grammars (MLG) ........ . 22 7. Zen, Haiku and PROLOG...Both of these are welcome extensions to the Chat methodology. - 23 - CHAPTER 7 Zen, Haiku and PROLOG The intent of this chapter is two fold. First, the...34cut away the superfluous and what is left is reality". A realization of the spirit of Zen can be found in haiku . Haiku are short poems that strive for
Reversing Plato’s Anti-Democratism: Castoriadis’ “Quirky” Plato
Wendy C. Hamblet
2008-01-01
This paper considers the conflicting "loves" of Cornelius Castoriadis--his love for the ancients, and especially Plato, and for the common person of the demos. A detailed study of Castoriadis' analysis of Plato's Statesman exposes that Castoriadis attempts to resolve the paradox by rereading Plato as a radical democrat. I argue that this unorthodox reading is at best "quirky, " (a charge Castoriadis levels at Plato) at worst a groundless sophism. However, I conjecture that Castoriadis' readin...
Eugenics concept: from Plato to present.
Güvercin, C H; Arda, B
2008-01-01
All prospective studies and purposes to improve cure and create a race that would be exempt of various diseases and disabilities are generally defined as eugenic procedures. They aim to create the "perfect" and "higher" human being by eliminating the "unhealthy" prospective persons. All of the supporting actions taken in order to enable the desired properties are called positive eugenic actions; the elimination of undesired properties are defined as negative eugenics. In addition, if such applications and approaches target the public as a whole, they are defined as macro-eugenics. On the other hand, if they only aim at individuals and/or families, they are called micro-eugenics. As generally acknowledged, Galton re-introduced eugenic proposals, but their roots stretch as far back as Plato. Eugenic thoughts and developments were widely accepted in many different countries beginning with the end of the 19th to the first half of the 20th centuries. Initially, the view of negative eugenics that included compulsory sterilizations of handicapped, diseased and "lower" classes, resulted in tens of thousands being exterminated especially in the period of Nazi Germany. In the 1930s, the type of micro positive eugenics movement found a place within the pro-natalist policies of a number of countries. However, it was unsuccessful since the policy was not able to become effective enough and totally disappeared in the 1960s. It was no longer a fashionable movement and left a deep impression on public opinion after the long years of war. However, developments in genetics and its related fields have now enabled eugenic thoughts to reappear under the spotlight and this is creating new moral dilemmas from an ethical perspective.
Directory of Open Access Journals (Sweden)
A Santos Jose C
2012-07-01
Full Text Available Abstract Background There is a need for automated methods to learn general features of the interactions of a ligand class with its diverse set of protein receptors. An appropriate machine learning approach is Inductive Logic Programming (ILP, which automatically generates comprehensible rules in addition to prediction. The development of ILP systems which can learn rules of the complexity required for studies on protein structure remains a challenge. In this work we use a new ILP system, ProGolem, and demonstrate its performance on learning features of hexose-protein interactions. Results The rules induced by ProGolem detect interactions mediated by aromatics and by planar-polar residues, in addition to less common features such as the aromatic sandwich. The rules also reveal a previously unreported dependency for residues cys and leu. They also specify interactions involving aromatic and hydrogen bonding residues. This paper shows that Inductive Logic Programming implemented in ProGolem can derive rules giving structural features of protein/ligand interactions. Several of these rules are consistent with descriptions in the literature. Conclusions In addition to confirming literature results, ProGolem’s model has a 10-fold cross-validated predictive accuracy that is superior, at the 95% confidence level, to another ILP system previously used to study protein/hexose interactions and is comparable with state-of-the-art statistical learners.
Positure in Plato's Laws: An Introduction to Figuration on Civic Education
Hall, Joshua M.
2016-01-01
Purpose: The aim of the research was to determine the benefits of applying the new Figuration philosophy of dance, based in part on Plato, to civic education. Design/methodology: A close phenomenological reading of Plato's "The Laws," with a strategic focus on its account of the concept of posture. Findings: Plato considers posture to be…
A driving pulse edge modulation technique and its complex programming logic devices implementation
Institute of Scientific and Technical Information of China (English)
Xiao CHEN; Dong-chang QU; Yong GUO; Guo-zhu CHEN
2015-01-01
With the continual increase in switching speed and rating of power semiconductors, the switching voltage spike becomes a serious problem. This paper describes a new technique of driving pulse edge modulation for insulated gate bipolar transistors (IGBTs). By modulating the density and width of the pulse trains, without regulating the hardware circuit, the slope of the gate driving voltage is controlled to change the switching speed. This technique is used in the driving circuit based on complex programmable logic devices (CPLDs), and the switching voltage spike of IGBTs can be restrained through software, which is easier and more flexible to adjust. Experimental results demonstrate the effectiveness and practicability of the proposed method.
Smullyan, Raymond
2008-01-01
This book features a unique approach to the teaching of mathematical logic by putting it in the context of the puzzles and paradoxes of common language and rational thought. It serves as a bridge from the author's puzzle books to his technical writing in the fascinating field of mathematical logic. Using the logic of lying and truth-telling, the author introduces the readers to informal reasoning preparing them for the formal study of symbolic logic, from propositional logic to first-order logic, a subject that has many important applications to philosophy, mathematics, and computer science. T
Korkmaz, Özgen
2016-01-01
The aim of this study was to investigate the effect of the Scratch and Lego Mindstorms Ev3 programming activities on academic achievement with respect to computer programming, and on the problem-solving and logical-mathematical thinking skills of students. This study was a semi-experimental, pretest-posttest study with two experimental groups and…
Plato's Cosmic Theology: A Rationale for a Polytheistic Astrology?
Henriques, André
2015-05-01
Plato's cosmology influenced classical astronomy and religion, but was in turn influenced by the polytheistic context of its time. Throughout his texts, including the cosmological treatise Timaeus, and the discussions on the soul in the Phaedrus, Plato (c.428-c.348 BC) established what can be generalised as Platonic cosmological thought. An understanding of the philosophical and mythical levels of Platonic thought can provide a rationale for polytheistic and astrological worldviews, pointing to some cosmological continuity, alongside major shifts, from ancient Greek religion to the astrological thought of ancient astronomers such as Claudius Ptolemy.
ESA's CCD test bench for the PLATO mission
Beaufort, Thierry; Duvet, Ludovic; Bloemmaert, Sander; Lemmel, Frederic; Prod'homme, Thibaut; Verhoeve, Peter; Smit, Hans; Butler, Bart; van der Luijt, Cornelis; Heijnen, Jerko; Visser, Ivo
2016-08-01
PLATO { PLAnetary Transits and Oscillations of stars { is the third medium-class mission to be selected in the European Space Agency (ESA) Science and Robotic Exploration Cosmic Vision programme. Due for launch in 2025, the payload makes use of a large format (8 cm x 8 cm) Charge-Coupled Devices (CCDs), the e2v CCD270 operated at 4 MHz and at -70 C. To de-risk the PLATO CCD qualification programme initiated in 2014 and support the mission definition process, ESA's Payload Technology Validation section from the Future Missions Office has developed a dedicated test bench.
DEFF Research Database (Denmark)
Klose, Karl; Ostermann, Klaus
2010-01-01
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze the probl......In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze...... the problems inhibiting separate checking and propose a class of logics that reconcile logic metaprogramming and separate checking. We have formalized the resulting module system and have proven the soundness of separate checking. We validate its feasibility by presenting the design and implementation...... of a specific logic that is able to express many metaprogramming examples from the literature....
Kleene, Stephen Cole
2002-01-01
Undergraduate students with no prior instruction in mathematical logic will benefit from this multi-part text. Part I offers an elementary but thorough overview of mathematical logic of 1st order. Part II introduces some of the newer ideas and the more profound results of logical research in the 20th century. 1967 edition.
Plato and Play: Taking Education Seriously in Ancient Greece
D'Angour, Armand
2013-01-01
In this article, the author outlines Plato's notions of play in ancient Greek culture and shows how the philosopher's views on play can be best appreciated against the background of shifting meanings and evaluations of play in classical Greece. Play--in various forms such as word play, ritual, and music--proved central to the development of…
Stonecutter Mills, Inc., Isothermal Community College. PLATO Evaluation Series.
Sherman, Greg
Stonecutter Mills, Inc., is a textile manufacturing company with a major production facility in Spindale, North Carolina. In the past few years, Stonecutter Mills employees have been given an opportunity to spend up to 2 hours a week on company time to participate in PLATO-supported learning at Isothermal Community College. Employees could choose…
Future development of the PLATO Observatory for Antarctic science
Ashley, Michael C. B.; Bonner, Colin S.; Everett, Jon R.; Lawrence, Jon S.; Luong-Van, Daniel; McDaid, Scott; McLaren, Campbell; Storey, John W. V.
2010-07-01
PLATO is a self-contained robotic observatory built into two 10-foot shipping containers. It has been successfully deployed at Dome A on the Antarctic plateau since January 2008, and has accumulated over 730 days of uptime at the time of writing. PLATO provides 0.5{1kW of continuous electrical power for a year from diesel engines running on Jet-A1, supplemented during the summertime with solar panels. One of the 10-foot shipping containers houses the power system and fuel, the other provides a warm environment for instruments. Two Iridium satellite modems allow 45 MB/day of data to be transferred across the internet. Future enhancements to PLATO, currently in development, include a more modular design, using lithium iron-phosphate batteries, higher power output, and a light-weight low-power version for eld deployment from a Twin Otter aircraft. Technologies used in PLATO include a CAN (Controller Area Network) bus, high-reliability PC/104 com- puters, ultracapacitors for starting the engines, and fault-tolerant redundant design.
Pursuing the Good, Ethics and Metaphysics in Plato s Republic
Institute of Scientific and Technical Information of China (English)
Douglas; Cairns; Fritz-Gregor; Herrmann; Terry; Penner
2008-01-01
‘Pursuing the good’ is an old subject in both social history of ancient Greece and Greek philosophy studies. There is hardly anything new when we talk about virtue or morality in the time of Plato and Aristotle. In the area of Greek history, many books and articles on or relevant to that
Eschatological narrative in Plato: between logos and myth
Directory of Open Access Journals (Sweden)
Francesc Casadesús Bordoy
2016-08-01
Full Text Available In his dialogues, Plato frequently resorted to alternate and intertwine his dialectic expositions with images and allegories, aiming to illustrate his arguments. This paper analyses in detail his use of the opposition between logos and myth tointroduce his descriptions of Hades
Go Tell Alcibiades: Tragedy, Comedy, and Rhetoric in Plato's "Symposium"
Crick, Nathan; Poulakos, John
2008-01-01
Plato's "Symposium" is a significant but neglected part of his elaborate and complex attitude toward rhetoric. Unlike the intellectual discussion of the "Gorgias" or the unscripted conversation of the "Phaedrus," the "Symposium" stages a feast celebrating and driven by the forces of "Eros." A luxuriously stylish performance rather than a rational…
The Cost of PLATO in a University Environment.
Hofstetter, Fred T.
1983-01-01
This analysis of the cost-effectiveness of the University of Delaware's own PLATO system discusses the initial expense of acquiring the system, decreases in unit cost as number of users increased, capital investment in hardware, expenditures and funding sources, comparisons of actual and projected costs, and benefits of individualized instruction.…
Dodecahedrane—The chemical transliteration of Plato's universe (A Review)
Paquette, Leo A.
1982-07-01
The development of chemical interest in three of Plato's five convex polyhedra is described from an historical perspective. The successful synthesis of 1,16-dimethyldodecahedrane and its structural characteristics are outlined. Finally, an account of recent work leading to the still more aesthetically appealing and ultrasymmetric parent dodecahedrane is given.
Arete and physics: The lesson of Plato's "Timaeus"
Wolfe, John R.
Plato's Timaeus is traditionally read as a work dedicated to the sole purpose of describing the origin and nature of the cosmos, as a straightforward attempt by Plato to produce a peri phuseos treatise. In accord with this reading, the body of Timaeus' monologue is then seen as nothing more than an attempt by Plato to convey his own cosmological doctrines. I propose an alternative to the view that the Timaeus is nothing more than a textbook of Platonic physics. The Timaeus is rather squarely focused on the human being, in her moral and political dimensions, and on her relation to the natural world as a whole. Ultimately, this account of the human being is intended to provide part of the answer to the question of how society can produce good citizens and leaders, and thus serves to provide a theoretical basis for the practices of paideia. When viewed in this light many of the curious features of the Timaeus appear less strange. The various parts of the dialogue: the dramatic introduction, Critias' tale of the Ancient Athenians, and Timaeus' monologue can be seen as each contributing to an investigation of a single topic. It further allows us to understand why Plato chooses to employ Timaeus the Locrian as the principle speaker of the dialogue rather than Socrates. Finally, when read in this way, the Timaeus no longer appears as an outlier in the Platonic corpus, as a work devoted to a radically different subject matter than the rest of his writings. It can be seen as dedicated to the same issues which preoccupied Plato throughout his entire life, as about the determination of the best life and providing the tools with which to realize it.
Welty, Gordon A.
The logic of the evaluation of educational and other action programs is discussed from a methodological viewpoint. However, no attempt is made to develop methods of evaluating programs. In Part I, the structure of an educational program is viewed as a system with three components--inputs, transformation of inputs into outputs, and outputs. Part II…
Standardising the lay: Logics of change in programs of disease self-management
DEFF Research Database (Denmark)
Juul, Annegrete; Grøn, Lone
2012-01-01
The health political discourse on self-care is dominated by the view that the selfmanaging patient represents a more democratic and patient-centric perspective, as he or she is believed to renegotiate the terms on which patient participation in health care has hitherto taken place. The self-manag...... questions these assumptions through an ethnographic exploration of a patient-led self-management program called the Chronic Disease Self-Management Program....
Quinn, Bill; Foshay, Rob; Morris, Barbara
The "PLATO[R] Math Expeditions" and "PLATO[R] Projects for the Real World" curricula are designed to implement effective, research-based instructional practices. "Math Expeditions" is designed to give elementary grade users the mathematics skills and practice needed to solve real-life problems. Across the eight…
“Pregnant’s house” program: a new logic of attention to maternal and perinatal health
Adriano Maçal Pimenta; Juliana Vieira Nazareth; Kleyde Ventura de Souza
2012-01-01
The program “ House for Pregnant women” is a strategy of the Ministry of Health in Brazil aiming fairness and humanization of assistance for the pregnant women at high risk. It was conducted an epidemiological, transversal, descriptive and exploratory study in the “ House for Pregnant women” of a philanthropic maternity hospital in Belo Horizonte city, aiming to evaluate the impact of this program on maternal health of the 292 pregnant women that used this service and their newborns (NB) . F...
Specification and Verification of GPGPU programs using Permission-based Separation logic
Huisman, Marieke; Mihelcic, M.
Graphics Processing Units (GPUs) are increasingly used for general-purpose applications because of their low price, energy efficiency and enormous computing power. Considering the importance of GPU applications, it is vital that the behaviour of GPU programs can be specified and proven correct
Specification and Verification of GPGPU programs using Permission-based Separation logic
Huisman, Marieke; Mihelcic, Matej
2013-01-01
Graphics Processing Units (GPUs) are increasingly used for general-purpose applications because of their low price, energy efficiency and enormous computing power. Considering the importance of GPU applications, it is vital that the behaviour of GPU programs can be specified and proven correct forma
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
DEFF Research Database (Denmark)
Bruynooghe, M.; Gallagher, John Patrick; Humbeeck, W. Van
2005-01-01
by the user, or automatically generated monomorphic types describing the success set of predicates. The latter types are less precise and result in weaker termination conditions than those obtained from declared types. Our type inference procedure involves solving set constraints generated from the program...
THE JOURNEY OF TRUTH: FROM PLATO TO ZOLA
Directory of Open Access Journals (Sweden)
Ribut Basuki
1999-01-01
Full Text Available Western theater theory and criticism is generally considered to be set forth by the Greeks. Plato was "the first theater critic" with his negative comments about theater owing to his idealistic views about "the truth." Then came Aristotle who used a different viewpoint from that of Plato, saying that there is "truth" in theater. However, hostile criticism on theater came back in the Middle Ages, championed by Tertulian before Aristotelian theory was revived by the neo-classicists such as Scaliger and Castelvetro. Theater theory and criticism discourse was then made more alive by the romanticists who disagreed with the neo-classicists' rigid rules on theater. As the influence of science became dominant in the theater world, naturalism and realism emerged and became the mainstream of theater theory and criticism until well into the twentieth century.
Choi, Jeeyae; Bakken, Suzanne; Lussier, Yves A; Mendonça, Eneida A
2006-01-01
Medical logic modules are a procedural representation for sharing task-specific knowledge for decision support systems. Based on the premise that clinicians may perceive object-oriented expressions as easier to read than procedural rules in Arden Syntax-based medical logic modules, we developed a method for improving the readability of medical logic modules. Two approaches were applied: exploiting the concept-oriented features of the Medical Entities Dictionary and building an executable Java program to replace Arden Syntax procedural expressions. The usability evaluation showed that 66% of participants successfully mapped all Arden Syntax rules to Java methods. These findings suggest that these approaches can play an essential role in the creation of human readable medical logic modules and can potentially increase the number of clinical experts who are able to participate in the creation of medical logic modules. Although our approaches are broadly applicable, we specifically discuss the relevance to concept-oriented nursing terminologies and automated processing of task-specific nursing knowledge.
Directory of Open Access Journals (Sweden)
Nadson Santana Reis
2015-05-01
Full Text Available This study is an initial attempt to assess the "Sports Training Program at School - Athlete at School" and is structured according to its wide three "lines of action", namely: encouragement and democratization of sports practices at school; development and dissemination of the Olympic and Paralympic values among students of basic education; and identification and guidance of young talents. In the case of the first two lines, the results show weaknesses, mismatches, and inaccuracies between the theoretical conceptual framework and the technical operational design. On the other hand, the last line confers identity and compliancy to the program, (redirecting the school and physical education to the old "game" of sports massification, and identification and selection of talents. Therefore, the considerations indicate the need to counteract the renewed risk of using the school, physical education, and educational sports policies in accordance with the desires and prerogatives of the sports sector stricto sensu.
Tugué, Tosiyuki; Slaman, Theodore
1989-01-01
These proceedings include the papers presented at the logic meeting held at the Research Institute for Mathematical Sciences, Kyoto University, in the summer of 1987. The meeting mainly covered the current research in various areas of mathematical logic and its applications in Japan. Several lectures were also presented by logicians from other countries, who visited Japan in the summer of 1987.
The necessity of dialectics according to Plato and Adorno
DEFF Research Database (Denmark)
Olsen, Anne-Marie Eggert
2009-01-01
The paper deals with the notion of philosophy as, on the one hand, an academic or scientific discipline and, on the other, something perhaps superior to the disciplines and in any case dealing with what is not a 'disciplinary' matter. Through an interpretation of Plato's concept of dialectics and...... and Adorno's understanding of philosophy as expression (Ausdruck) it is proposed that this two-fold nature of philosophy is what makes dialectics necessary....
PROBABILISTIC COST ANALYSIS OF LOGIC PROGRAMS ANÁLISIS DE COSTO PROBABILÍSTICO DE PROGRAMAS LÓGICOS
Directory of Open Access Journals (Sweden)
Héctor Juan Soza Pollman
2009-08-01
Full Text Available Cost analyses of logic programs have been developed which make it possible to obtain automatically lower and upper bounds of runtime cost of computations. This information is very useful for a variety of purposes, including granularity control, query optimization in databases, and program transformation and synthesis. However, current techniques suffer a loss of accuracy in some cases which are quite representative (i.e., some divide-and-conquer programs as QuickSort. This paper describes an alternative probabilistic approach which makes it possible to figure out an estimate of the execution cost. One of its advantages is that it needs only a few changes over previously proposed schemes.Se han desarrollado análisis de costos de programas lógicos para obtener automáticamente cotas superiores e inferiores del costo del tiempo de ejecución de dicho tipo de programas. Esta información es muy útil para una variedad de propósitos, incluyendo control de granularidad, optimización de consultas en bases de datos, y transformación de programas y síntesis. Sin embargo, las técnicas actuales carecen de exactitud en algunos casos que son bastante representativos (por ejemplo, algunos programas de dividir para reinar como Quicksort. Este artículo describe un enfoque probabilístico alternativo que hace posible obtener una estimación más precisa del costo de ejecución. Una de sus ventajas es que plantea sólo unos pocos cambios sobre los esquemas propuestos previamente.
Fisher, Michael; Gabbay, Dov; Gough, Graham
2000-01-01
Time is a fascinating subject that has captured mankind's imagination from ancient times to the present. It has been, and continues to be studied across a wide range of disciplines, from the natural sciences to philosophy and logic. More than two decades ago, Pnueli in a seminal work showed the value of temporal logic in the specification and verification of computer programs. Today, a strong, vibrant international research community exists in the broad community of computer science and AI. This volume presents a number of articles from leading researchers containing state-of-the-art results in such areas as pure temporal/modal logic, specification and verification, temporal databases, temporal aspects in AI, tense and aspect in natural language, and temporal theorem proving. Earlier versions of some of the articles were given at the most recent International Conference on Temporal Logic, University of Manchester, UK. Readership: Any student of the area - postgraduate, postdoctoral or even research professor ...
Optical and dark characterization of the PLATO CCD at ESA
Verhoeve, Peter; Prod'homme, Thibaut; Oosterbroek, Tim; Duvet, Ludovic; Beaufort, Thierry; Blommaert, Sander; Butler, Bart; Heijnen, Jerko; Lemmel, Frederic; van der Luijt, Cornelis; Smit, Hans; Visser, Ivo
2016-07-01
PLATO - PLAnetary Transits and Oscillations of stars - is the third medium-class mission (M3) to be selected in the European Space Agency (ESA) Science and Robotic Exploration Cosmic Vision programme. It is due for launch in 2025 with the main objective to find and study terrestrial planets in the habitable zone around solar-like stars. The payload consists of >20 cameras; with each camera comprising 4 Charge-Coupled Devices (CCDs), a large number of flight model devices procured by ESA shall ultimately be integrated on the spacecraft. The CCD270 - specially designed and manufactured by e2v for the PLATO mission - is a large format (8 cm x 8 cm) back-illuminated device operating at 4 MHz pixel rate and coming in two variants: full frame and frame transfer. In order to de-risk the PLATO CCD procurement and aid the mission definition process, ESA's Payload Technology Validation section is currently validating the PLATO CCD270. This validation consists in demonstrating that the device achieves its specified electrooptical performance in the relevant environment: operated at 4 MHz, at cold and before and after proton irradiation. As part of this validation, CCD270 devices have been characterized in the dark as well as optically with respect to performance parameters directly relevant for the photometric application of the CCDs. Dark tests comprise the measurement of gain sensitivity to bias voltages, charge injection tests, and measurement of hot and variable pixels after irradiation. In addition, the results of measurements of Quantum Efficiency for a range of angles of incidence, intra- pixel response (non-)uniformity, and response to spot illumination, before and after proton irradiation. In particular, the effect of radiation induced degradation of the charge transfer efficiency on the measured charge in a star-like spot has been studied as a function of signal level and of position on the pixel grid, Also, the effect of various levels of background light on the
2014-10-03
that must be woven into proofs of security statements. 03-10-2014 Memorandum Report Logic System-on-a-Chip Distributed systems 9888 ASDR&EAssistant...can be removed without damaging the logic. For all propositional letters p, E1. p ⊃ [r] p From now on, a distributed logic contains at least the...a ∈ x iff 〈h〉 ∈ x. These same definitions work for the canonical relation R for r : h y k where now a ∈ MA(k), [r] a, 〈r〉 a ∈ MA(h), x ∈ CF(h), and
Linear Logical Voting Protocols
DEFF Research Database (Denmark)
DeYoung, Henry; Schürmann, Carsten
2012-01-01
. In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW- FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise......Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification...... implementations that closely correspond to their legal specification, thereby increasing trust....
The GUIDO System and the PLATO Project.
Arenson, Michael A.; Hofstetter, Fred T.
1983-01-01
The GUIDO system offers programing in ear training and theory for kindergarten through college levels, using high-resolution graphics, touch input, and a sound synthesizer. Ear training includes intervals, melodies, chord qualities, harmonies, and rhythm. Theory covers octave designation, beat units, scales, intervals, diatonic chords,…
Lengyel, Florian
2012-01-01
We define Denial Logic DL, a system of justification logic that models an agent whose justified beliefs are false, who cannot avow his own propositional attitudes and who can believe contradictions but not tautologies of classical propositional logic. Using Artemov's natural semantics for justification logic JL, in which justifications are interpreted as sets of formulas, we provide an inductive construction of models of DL, and prove soundness and completeness results for DL. Some logical notions developed for JL, such as constant specifications and the internalization property, are inconsistent with DL. This leads us to define negative constant specifications for DL, which can be used to model agents with justified false beliefs. Denial logic can therefore be relevant to philosophical skepticism. We use DL with what we call coherent negative constant specifications to model a Putnamian brain in a vat with the justified false belief that it is not a brain in a vat, and derive a model of JL in which "I am a b...
Efficient methods for solving discrete topology design problems in the PLATO-N project
DEFF Research Database (Denmark)
Canh, Nam Nguyen; Stolpe, Mathias
This paper considers the general multiple load structural topology design problems in the framework of the PLATO-N project. The problems involve a large number of discrete design variables and were modeled as a non-convex mixed 0–1 program. For the class of problems considered, a global...... optimization method based on the branch-and-cut concept was developed and implemented. In the method a large number of continuous relaxations were solved. We also present an algorithm for generating cuts to strengthen the quality of the relaxations. Several heuristics were also investigated to obtain efficient...... algorithms. The branch and cut method is used to solve benchmark examples which can be used to validate other methods and heuristics....
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area.......Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area....
The Inverse Method Application for Non-Classical Logics
Pavlov, V.; Paky, V.
2015-01-01
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer programs that prove theorems automatically (such programs are called theorem provers). The inverse method can be applied to a wide range of logical calculi: propositional logic, ﬁrst-order logic, intuitionistic logic, modal logics etc. We give a brief historical background of the inverse method, then discuss existing modiﬁcations and implementations of the inverse method for non-classical logics...
Institute of Scientific and Technical Information of China (English)
Hongsheng QI; Daizhan CHENG
2008-01-01
This paper gives a matrix expression of logic. Under the matrix expression, a general description of the logical operators is proposed. Using the semi-tensor product of matrices, the proofs of logical equivalences, implications, etc., can be simplified a lot. Certain general properties are revealed. Then, based on matrix expression, the logical operators are extended to multi-valued logic, which provides a foundation for fuzzy logical inference. Finally, we propose a new type of logic, called mix-valued logic, and a new design technique, called logic-based fuzzy control. They provide a numerically computable framework for the application of fuzzy logic for the control of fuzzy systems.
Simulated Laboratory in Digital Logic.
Cleaver, Thomas G.
Design of computer circuits used to be a pencil and paper task followed by laboratory tests, but logic circuit design can now be done in half the time as the engineer accesses a program which simulates the behavior of real digital circuits, and does all the wiring and testing on his computer screen. A simulated laboratory in digital logic has been…
Logical Querying of Relational Databases
Directory of Open Access Journals (Sweden)
Luminita Pistol
2016-12-01
Full Text Available This paper aims to demonstrate the usefulness of formal logic and lambda calculus in database programming. After a short introduction in propositional and first order logic, we implement dynamically a small database and translate some SQL queries in filtered java 8 streams, enhanced with Tuples facilities from jOOλ library.
Barriers in Concurrent Separation Logic
Hobor, Aquinas; Gherghina, Cristian
We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two. Unlike locks and critical sections, Pthreads barriers enable simultaneous resource redistribution between multiple threads and are inherently stateful, leading to significant complications in the design of the logic and its soundness proof. We show how our logic can be applied to a specific example program in a modular way. Our proofs are machine-checked in Coq.
The Philosopher's Arete or theStructure of Plato's Parmenides
Directory of Open Access Journals (Sweden)
Raúl Gutierrez
1998-12-01
Full Text Available The controversy conceming the unity of Plato's Parmenides and the meaning of its first part is stillongoing. The A. proposes a solution, pointing out its structural coincidence with the Republic's simile of the line. This leads him to confine young Socrates in the segment that corresponds to óuivoux and old Parmenides in the vór¡olc; segment. As the one who "possesses insight" of truth based on his apprehension of the One-Good. Parmenides is the actual representative of the philosopher's arete.
Tibial plato leveling osteotomy / Osteotomia de nivelamento do plato da tíbia
Directory of Open Access Journals (Sweden)
Julia Maria Matera
2008-08-01
Full Text Available The tibial plateau leveling osteotomy (TPLO is a relatively new and innovative surgical treatment for the cranial cruciate ligament rupture in the canine species. The real intent of the procedure is to provide functional stability to the stifle joint by eliminating or neutralizing the cranial tibial thrust during weight bearing instead to restore the cranial cruciate ligament function. The proposal of this study is to report a review of the TPLO procedure, emphasizing procedure, surgical technique, post operative care and complications. The TPLO procedure consists in a radial osteotomy in the tibial plato and rotation of the caudal plateau in order to obtain a desired angle. After the leveling of the tibial plateau, a bone plate and screws are used to stabilize the osteotomy until bone is healed up. The complications that have been associated with the procedure include tibial tuberosity fracture and patellar tendon tendinosis. This procedure has become increasingly more popular for surgical treatment of cranial cruciate ligament injuries in large breed dog. The long term clinical results have not been completely elucidated yet. It has been showed that this technique doesn’t halt the degenerative joint disease.A osteotomia do platô da tíbia (TPLO é um tratamento relativamente novo e inovador para a ruptura do ligamento cruzado cranial (RLCC na espécie canina. Ao invés de restaurar a função do ligamento, o procedimento promove estabilidade funcional para a articulação do joelho, por eliminar ou neutralizar a força tibial cranial durante a sustentação de peso. A proposta do presente estudo é revisar a técnica de TPLO, enfatizando o procedimento, técnica cirúrgica, cuidados pós-operatórios e complicações. A técnica da TPLO consiste na realização de uma osteotomia circular do platô da tíbia com rotação de sua porção caudal até a obtenção do ângulo desejado. Após o nivelamento do platô da tíbia, placa e parafusos
Reversing Plato’s Anti-Democratism: Castoriadis’ “Quirky” Plato
Directory of Open Access Journals (Sweden)
Hamblet, Wendy C.
2008-12-01
Full Text Available This paper considers the conflicting "loves" of Cornelius Castoriadis--his love for the ancients, and especially Plato, and for the common person of the demos. A detailed study of Castoriadis' analysis of Plato's Statesman exposes that Castoriadis attempts to resolve the paradox by rereading Plato as a radical democrat. I argue that this unorthodox reading is at best "quirky, " (a charge Castoriadis levels at Plato at worst a groundless sophism. However, I conjecture that Castoriadis' reading may not constitute a serious attempt to describe a Platonic politics, so much as a prescriptive reading of what otherwise might have been, given certain strands of political generosity evident elsewhere in Plato's corpus.
Bergstra, J.A.; Ponse, A.
2010-01-01
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. A short-circuit logic is a variant of p
Macian-Sorribes, Hector; Pulido-Velazquez, Manuel
2016-04-01
This contribution presents a methodology for defining optimal seasonal operating rules in multireservoir systems coupling expert criteria and stochastic optimization. Both sources of information are combined using fuzzy logic. The structure of the operating rules is defined based on expert criteria, via a joint expert-technician framework consisting in a series of meetings, workshops and surveys carried out between reservoir managers and modelers. As a result, the decision-making process used by managers can be assessed and expressed using fuzzy logic: fuzzy rule-based systems are employed to represent the operating rules and fuzzy regression procedures are used for forecasting future inflows. Once done that, a stochastic optimization algorithm can be used to define optimal decisions and transform them into fuzzy rules. Finally, the optimal fuzzy rules and the inflow prediction scheme are combined into a Decision Support System for making seasonal forecasts and simulate the effect of different alternatives in response to the initial system state and the foreseen inflows. The approach presented has been applied to the Jucar River Basin (Spain). Reservoir managers explained how the system is operated, taking into account the reservoirs' states at the beginning of the irrigation season and the inflows previewed during that season. According to the information given by them, the Jucar River Basin operating policies were expressed via two fuzzy rule-based (FRB) systems that estimate the amount of water to be allocated to the users and how the reservoir storages should be balanced to guarantee those deliveries. A stochastic optimization model using Stochastic Dual Dynamic Programming (SDDP) was developed to define optimal decisions, which are transformed into optimal operating rules embedding them into the two FRBs previously created. As a benchmark, historical records are used to develop alternative operating rules. A fuzzy linear regression procedure was employed to
Can Mathematics be Justified by Natural Logic?
Schreiber, Lothar; Sommer, Hanns
2010-11-01
Charles Darwin claimed that the forms and the behaviour of living beings can be explained from their will to survive. But what are the consequences of this idea for humans knowledge, their theories of nature and their mathematics?. We discuss the view that even Plato's objective world of mathematical objects does not exist absolutely, without the intentions of mathematicians. Using Husserl's Phenomenological Method, cognition can be understood as a process by which meaning is deduced from empirical data relative to intentions. Thereby the essential structure of any cognition process can be detected and this structure is mirrored in logic. A natural logic becomes the direct result of cognition. Only in a second step, mathematics is obtained by abstraction from natural logic. In this way mathematics gains a well-defined foundation and is no longer part of a dubious 'a-priori knowledge' (Kant). This access to mathematics offers a new look on many old problems, e.g. the Petersburg problem and the problem 'P = NP?'. We demonstrate that this new justification of mathematics has also important applications in Artificial Intelligence. Our method provides a procedure to construct an adequate logic to solve most efficiently the problems of a given problem class. Thus, heuristics can be tailor-made for the necessities of applications.
Diagnosable structured logic array
Whitaker, Sterling (Inventor); Miles, Lowell (Inventor); Gambles, Jody (Inventor); Maki, Gary K. (Inventor)
2009-01-01
A diagnosable structured logic array and associated process is provided. A base cell structure is provided comprising a logic unit comprising a plurality of input nodes, a plurality of selection nodes, and an output node, a plurality of switches coupled to the selection nodes, where the switches comprises a plurality of input lines, a selection line and an output line, a memory cell coupled to the output node, and a test address bus and a program control bus coupled to the plurality of input lines and the selection line of the plurality of switches. A state on each of the plurality of input nodes is verifiably loaded and read from the memory cell. A trusted memory block is provided. The associated process is provided for testing and verifying a plurality of truth table inputs of the logic unit.
Zadeh, Lofti A.
1988-01-01
The author presents a condensed exposition of some basic ideas underlying fuzzy logic and describes some representative applications. The discussion covers basic principles; meaning representation and inference; basic rules of inference; and the linguistic variable and its application to fuzzy control.
Weak Completeness of Coalgebraic Dynamic Logics
Kupke, C.; Hansen, H.H.
2015-01-01
We present a coalgebraic generalisation of Fischer and Ladner’s Propositional Dynamic Logic (PDL) and Parikh’s Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a m
Weak Completeness of Coalgebraic Dynamic Logics
Hansen, H.H.; Kupke, C.A.
2015-01-01
We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a m
On the Automatic Evolution of an OS Kernel Using Temporal Logic and AOP
DEFF Research Database (Denmark)
Åberg, Rickard; Lawall, Julia Laetitia; Sudholt, Mario
2003-01-01
aspect-oriented programing, temporal logic, process scheduling, Linux, domain-specific languages......aspect-oriented programing, temporal logic, process scheduling, Linux, domain-specific languages...
A Brief History of Fuzzy Logic
Directory of Open Access Journals (Sweden)
Angel Garrido
2012-04-01
Full Text Available
The problems of uncertainty, imprecision and vagueness have been discussed for many years. These problems have been major topics in philosophical circles with much debate, in particular, about the nature of vagueness and the ability of traditional Boolean logic to cope with concepts and perceptions that are imprecise or vague. The Fuzzy Logic (which is usually translated into Castilian by “Lógica Borrosa”, or “Lógica Difusa”, but also by “Lógica Heurística” can be considered a bypass-valued logics (Multi-valued Logic, MVL, its acronym in English. It is founded on, and is closely related to-Fuzzy Sets Theory, and successfully applied on Fuzzy Systems. You might think that fuzzy logic is quite recent and what has worked for a short time, but its origins date back at least to the Greek philosophers and especially Plato (428-347 B.C.. It even seems plausible
to trace their origins in China and India. Because it seems that they were the first to consider that all things need not be of a certain type or quit, but there are a stopover between. That is, be the pioneers in considering that there may be varying degrees of truth and falsehood. In case of colors, for example, between white and black there is a whole infinite scale: the shades of gray. Some recent theorems show that in principle fuzzy logic can be used to model any continuous system, be it based
in AI, or physics, or biology, or economics, etc. Investigators in many fields may find that fuzzy, commonsense models are more useful, and many more accurate than are standard mathematical ones. We analyze here the history and development of this problem: Fuzziness, or “Borrosidad” (in Castilian, essential to work with Uncertainty.
Institute of Scientific and Technical Information of China (English)
林作铨; 李未
1995-01-01
Parametric logic is introduced. The language, semantics and axiom system of parametric logic are defined. Completeness theorem of parametric logic is provided. Parametric logic has formal ability powerful enough to capture a wide class of logic as its special cases, and therefore can be viewed as a uniform basis for modern logics.
Love as an Object of Initiation in Plato's Philosophy
Directory of Open Access Journals (Sweden)
Euaggelia Maraggianou
2007-07-01
Full Text Available Initiation ( muvhsh was the first stage of the ancient mysteries celebrating Demeter, the earth-goddess, and her daughter Kore, soon identified with Persephone or Persephasa, a pre-Greek deity of the underworld. Next came the stage of contemplation ( ejpopteiva , at which worshippers were shown a vision of the goddess of Hades. This led them to identify themselves with her, thus reaching the highest form of happiness. The Eleusinian Mysteries were inseparably linked to the Orphic doctrine, which in its turn influenced the thought of Plato. Plato sees love as an object of initiation and as one of the greatest mysteries of human existence. Plato’s dialogues, Phaedrus and Symposium, contain expressions borrowed directly from the vocabulary of the Mysteries. Although neither Socrates in Phaedrus nor Diotima in Symposium make any explicit reference to the mystic ceremonies, it is certain that both allude to them in expounding the mysteries of spiritual life. The latter has to start at the stage of physical love in order to end up in the contemplation of Ideas. The mystery into which Socrates is initiated by Diotima is the following: there is a mystic stairway leading from the earth to the sky, from man to God. It is made visible by Love, and its steps are represented by different kinds of beauty. The ascent is a gradual one, with a long stop at each of the stages. In this way Love, disciplined by philosophy and spiritualised by increasing de-personalisation, ends up in the Intellectual, conceiving the latter with an intuitive insight. By this spiritual process, one is purified, led to the road of salvation and enabled to participate in the Divine.
PLATO as it is : A legacy mission for Galactic archaeology
Miglio, A.; Chiappini, C.; Mosser, B.; Davies, G. R.; Freeman, K.; Girardi, L.; Jofré, P.; Kawata, D.; Rendle, B. M.; Valentini, M.; Casagrande, L.; Chaplin, W. J.; Gilmore, G.; Hawkins, K.; Holl, B.; Appourchaux, T.; Belkacem, K.; Bossini, D.; Brogaard, K.; Goupil, M.-J.; Montalbán, J.; Noels, A.; Anders, F.; Rodrigues, T.; Piotto, G.; Pollacco, D.; Rauer, H.; Prieto, C. Allende; Avelino, P. P.; Babusiaux, C.; Barban, C.; Barbuy, B.; Basu, S.; Baudin, F.; Benomar, O.; Bienaymé, O.; Binney, J.; Bland-Hawthorn, J.; Bressan, A.; Cacciari, C.; Campante, T. L.; Cassisi, S.; Christensen-Dalsgaard, J.; Combes, F.; Creevey, O.; Cunha, M. S.; Jong, R. S.; Laverny, P.; Degl'Innocenti, S.; Deheuvels, S.; Depagne, É.; Ridder, J.; Matteo, P. Di; Mauro, M. P. Di; Dupret, M.-A.; Eggenberger, P.; Elsworth, Y.; Famaey, B.; Feltzing, S.; García, R. A.; Gerhard, O.; Gibson, B. K.; Gizon, L.; Haywood, M.; Handberg, R.; Heiter, U.; Hekker, S.; Huber, D.; Ibata, R.; Katz, D.; Kawaler, S. D.; Kjeldsen, H.; Kurtz, D. W.; Lagarde, N.; Lebreton, Y.; Lund, M. N.; Majewski, S. R.; Marigo, P.; Martig, M.; Mathur, S.; Minchev, I.; Morel, T.; Ortolani, S.; Pinsonneault, M. H.; Plez, B.; Moroni, P. G. Prada; Pricopi, D.; Recio-Blanco, A.; Reylé, C.; Robin, A.; Roxburgh, I. W.; Salaris, M.; Santiago, B. X.; Schiavon, R.; Serenelli, A.; Sharma, S.; Aguirre, V. Silva; Soubiran, C.; Steinmetz, M.; Stello, D.; Strassmeier, K. G.; Ventura, P.; Ventura, R.; Walton, N. A.; Worley, C. C.
2017-07-01
Deciphering the assembly history of the Milky Way is a formidable task, which becomes possible only if one can produce high-resolution chrono-chemo-kinematical maps of the Galaxy. Data from large-scale astrometric and spectroscopic surveys will soon provide us with a well-defined view of the current chemo-kinematical structure of the Milky Way, but will only enable a blurred view on the temporal sequence that led to the present-day Galaxy. As demonstrated by the (ongoing) exploitation of data from the pioneering photometric missions CoRoT, Kepler, and K2, asteroseismology provides the way forward: solar-like oscillating giants are excellent evolutionary clocks thanks to the availability of seismic constraints on their mass and to the tight age-initial-mass relation they adhere to. In this paper we identify five key outstanding questions relating to the formation and evolution of the Milky Way that will need precise and accurate ages for large samples of stars to be addressed, and we identify the requirements in terms of number of targets and the precision on the stellar properties that are needed to tackle such questions. By quantifying the asteroseismic yields expected from PLATO for red-giant stars, we demonstrate that these requirements are within the capabilities of the current instrument design, provided that observations are sufficiently long to identify the evolutionary state and allow robust and precise determination of acoustic-mode frequencies. This will allow us to harvest data of sufficient quality to reach a 10% precision in age. This is a fundamental pre-requisite to then reach the more ambitious goal of a similar level of accuracy, which will only be possible if we have to hand a careful appraisal of systematic uncertainties on age deriving from our limited understanding of stellar physics, a goal which conveniently falls within the main aims of PLATO's core science.
DEFF Research Database (Denmark)
Friche, Nanna; Normann Andersen, Vibeke
combined with state funding through a taximeter scheme (pay per student). Secondly, party governance system involving labor market partners at both national and local level formalized through a national Council for Vocational Training and 50 local trade committees as well as local education committees......For the last fifteen years completion rates in Danish vocational education and training (VET) has stayed on a rather low level. In 2014, only half of the students enrolled in a vocational program on upper secondary level, graduated from the program (Flarup et al 2016). In Denmark, like in other...... and well-being of students enrolled in the VETs must be strengthened. We focus on target 1, 2 and 4. The reform is being implemented in a field of VET that can be characterized by four logics of governance. Firstly, a governance logic characterized by institutional independence of vocational colleges...
Angiographic outcomes in the PLATO Trial (Platelet Inhibition and Patient Outcomes)
National Research Council Canada - National Science Library
Kunadian, Vijay; James, Stefan K; Wojdyla, Daniel M; Zorkun, Cafer; Wu, Jinhui; Storey, Robert F; Steg, Ph Gabriel; Katus, Hugo; Emanuelsson, Hakan; Horrow, Jay; Maya, Juan; Wallentin, Lars; Harrington, Robert A; Gibson, C Michael
2013-01-01
The PLATO (Platelet Inhibition and Patient Outcomes) angiographic substudy sought to compare the efficacy of ticagrelor versus clopidogrel with respect to angiographic outcomes before and after PCI in the setting of acute coronary syndrome...
The Legacies of Literacy: From Plato to Freire through Harvey Graff.
Gee, James Paul
1989-01-01
Reviews "The Legacies of Literacy: Continuities and Contradictions in Western Culture and Society" (Harvey G. Graff). Discusses the historical role of literacy education as a tool for liberation, emphasizing the viewpoints of Plato and Freire. (FMW)
Genesis 2–3 and Alcibiades's speech in Plato's Symposium : A ...
African Journals Online (AJOL)
Genesis 2–3 and Alcibiades's speech in Plato's Symposium : A cultural critical reading. ... interpretation can arise from the analysis of Alcibiades's speech compared to M- and LXX-Genesis ... EMAIL FREE FULL TEXT EMAIL FREE FULL TEXT
Prospects for detecting decreasing exoplanet frequency with main sequence age using PLATO
Veras, Dimitri; Mustill, Alexander J; Pollacco, Don
2015-01-01
The space mission PLATO will usher in a new era of exoplanetary science by expanding our current inventory of transiting systems and constraining host star ages, which are currently highly uncertain. This capability might allow PLATO to detect changes in planetary system architecture with time, particularly because planetary scattering due to Lagrange instability may be triggered long after the system was formed. Here, we utilize previously published instability timescale prescriptions to determine PLATO's capability to detect a trend of decreasing planet frequency with age for systems with equal-mass planets. For two-planet systems, our results demonstrate that PLATO may detect a trend for planet masses which are at least as massive as super-Earths. For systems with three or more planets, we link their initial compactness to potentially detectable frequency trends in order to aid future investigations when these populations will be better characterized.
Plato's Charmides as a Political Act: Apologetics and the Promotion of Ideology
National Research Council Canada - National Science Library
Danzig, Gabriel
2013-01-01
By showing that Critias and Socrates understood the same matters differently, Plato was able to treat seriously ideas that came to be associated with the Thirty and with Socrates while shielding himself from criticism...
Malcolm, Norman; Altuner, Ilyas
2015-01-01
The paper deals exclusively with the doctrine called ‘Logical Behaviorism’. Although this position does not vogue it enjoyed in the 1930s and 1940s, it will always possess a compelling attraction for anyone who is perplexed by the psychological concepts, who has become aware of worthlessness of an appeal to introspection as an account of how we learn those concepts, and he has no inclination to identify mind with brain. There, of course, are other forms of behaviorism, and of reductionism, wh...
The music of morality and logic.
Mesz, Bruno; Rodriguez Zivic, Pablo H; Cecchi, Guillermo A; Sigman, Mariano; Trevisan, Marcos A
2015-01-01
Musical theory has built on the premise that musical structures can refer to something different from themselves (Nattiez and Abbate, 1990). The aim of this work is to statistically corroborate the intuitions of musical thinkers and practitioners starting at least with Plato, that music can express complex human concepts beyond merely "happy" and "sad" (Mattheson and Lenneberg, 1958). To do so, we ask whether musical improvisations can be used to classify the semantic category of the word that triggers them. We investigated two specific domains of semantics: morality and logic. While morality has been historically associated with music, logic concepts, which involve more abstract forms of thought, are more rarely associated with music. We examined musical improvisations inspired by positive and negative morality (e.g., good and evil) and logic concepts (true and false), analyzing the associations between these words and their musical representations in terms of acoustic and perceptual features. We found that music conveys information about valence (good and true vs. evil and false) with remarkable consistency across individuals. This information is carried by several musical dimensions which act in synergy to achieve very high classification accuracy. Positive concepts are represented by music with more ordered pitch structure and lower harmonic and sensorial dissonance than negative concepts. Music also conveys information indicating whether the word which triggered it belongs to the domains of logic or morality (true vs. good), principally through musical articulation. In summary, improvisations consistently map logic and morality information to specific musical dimensions, testifying the capacity of music to accurately convey semantic information in domains related to abstract forms of thought.
The music of morality and logic
Directory of Open Access Journals (Sweden)
Bruno eMesz
2015-07-01
Full Text Available Musical theory has built on the premise that musical structures can refer to something different from themselves (1. The aim of this work is to statistically corroborate the intuitions of musical thinkers and practitioners from Plato to Boethius to the purveyors of the Baroque Doctrine of Affections that music can express complex human concepts beyond merely happy and sad (2. To do so, we ask whether musical improvisations can be used to classify the semantic category of the word that triggers them. We investigated two specific domains of semantics: morality and logic. While morality has been historically associated with music, logic concepts, which involve more abstract forms of thought, are more rarely associated with music. We examined musical improvisations inspired by positive and negative morality (e.g. good and evil and logic concepts (true and false, analyzing the associations between these words and their musical representations in terms of acoustic and perceptual features. We found that music conveys information about valence (good and true vs. evil and false with remarkable consistency across individuals. This information is carried by several musical dimensions which act in synergy to achieve very high classification accuracy. Positive concepts are represented by music with more ordered pitch structure and lower harmonic and sensorial dissonance than negative concepts. Music also conveys information indicating whether the word which triggered it belongs to the domains of logic or morality (true vs. good, principally through musical articulation. In summary, improvisations consistently map logic and morality information to specific musical dimensions, testifying the capacity of music to accurately convey semantic information in domains related to abstract forms of thought.
Flow Logics and Operational Semantics
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1998-01-01
Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analysis...... correct. Our main conclusion is that environment based semantics is more flexible than either substitution based semantics or semantics making use of structural congruences (like alpha-renaming)....
Proceedings of a symposium on logic in computer science
Energy Technology Data Exchange (ETDEWEB)
1987-01-01
This book presents the papers given at a conference on the mathematical logic of computers. Topics considered at the conference included order-sorted algebra, models of concurrency, stratified logic programming, optimization problems for database logic problems, concurrent programs, programming languages, and inference rules for rewrite-based first-order theorem proving.
DEFF Research Database (Denmark)
Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume...... is the proceedings of the conference of record in its fi eld, Advances in Modal Logic. Its contributions are state-of-the-art papers. The topics include decidability and complexity results for specifi c modal logics, proof theory of modal logic, logics for reasoning about time and space, provability logic, dynamic...... epistemic logic, and the logic of evidence....
Aschieri, Federico
2016-01-01
Dummett's logic LC is intuitionistic logic extended with Dummett's axiom: for every two statements the first implies the second or the second implies the first. We present a natural deduction and a Curry-Howard correspondence for first-order and second-order Dummett's logic. We add to the lambda calculus an operator which represents, from the viewpoint of programming, a mechanism for representing parallel computations and communication between them, and from the point of view logic, Dummett's...
Carlton, David Bryan
The exponential improvements in speed, energy efficiency, and cost that the computer industry has relied on for growth during the last 50 years are in danger of ending within the decade. These improvements all have relied on scaling the size of the silicon-based transistor that is at the heart of every modern CPU down to smaller and smaller length scales. However, as the size of the transistor reaches scales that are measured in the number of atoms that make it up, it is clear that this scaling cannot continue forever. As a result of this, there has been a great deal of research effort directed at the search for the next device that will continue to power the growth of the computer industry. However, due to the billions of dollars of investment that conventional silicon transistors have received over the years, it is unlikely that a technology will emerge that will be able to beat it outright in every performance category. More likely, different devices will possess advantages over conventional transistors for certain applications and uses. One of these emerging computing platforms is nanomagnetic logic (NML). NML-based circuits process information by manipulating the magnetization states of single-domain nanomagnets coupled to their nearest neighbors through magnetic dipole interactions. The state variable is magnetization direction and computations can take place without passing an electric current. This makes them extremely attractive as a replacement for conventional transistor-based computing architectures for certain ultra-low power applications. In most work to date, nanomagnetic logic circuits have used an external magnetic clocking field to reset the system between computations. The clocking field is then subsequently removed very slowly relative to the magnetization dynamics, guiding the nanomagnetic logic circuit adiabatically into its magnetic ground state. In this dissertation, I will discuss the dynamics behind this process and show that it is greatly
Institute of Scientific and Technical Information of China (English)
小雨
2006-01-01
A teacher was giving her pu- pils a lesson on logic(逻辑)．“Here is the situation(情景),”she said,“a man is stand- ing up in a boat in the middle of a river,fishing．He loses his bal- ance(平衡),falls in,and begins splashing(泼水)and yelling(叫喊)for help．His wife hears the commotion(喧闹),knows that he can’t swim,and runs down to the bank (河岸)．Why did she run to the bank?” A girl raised her hand and asked,“To draw out(提取)all of his savings(存款)．”
Paraconsistent Computational Logic
DEFF Research Database (Denmark)
Jensen, Andreas Schmidt; Villadsen, Jørgen
2012-01-01
In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....
Doberkat, Ernst-Erich
2009-01-01
Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles of coalgebraic logic from a categorical perspective. Modal logics are also discussed, including probabilistic interpretations and an analysis of Kripke models.
Eskolemization in intuitionistic logic
Baaz, Matthias; Iemhoff, R.
In [2] an alternative skolemization method called eskolemization was introduced that is sound and complete for existence logic with respect to existential quantifiers. Existence logic is a conservative extension of intuitionistic logic by an existence predicate. Therefore eskolemization provides a
Introduction to fuzzy logic using Matlab
Sivanandam, SN; Deepa, S N
2006-01-01
Fuzzy Logic, at present is a hot topic, among academicians as well various programmers. This book is provided to give a broad, in-depth overview of the field of Fuzzy Logic. The basic principles of Fuzzy Logic are discussed in detail with various solved examples. The different approaches and solutions to the problems given in the book are well balanced and pertinent to the Fuzzy Logic research projects. The applications of Fuzzy Logic are also dealt to make the readers understand the concept of Fuzzy Logic. The solutions to the problems are programmed using MATLAB 6.0 and the simulated results are given. The MATLAB Fuzzy Logic toolbox is provided for easy reference.
From Interpreter to Logic Engine by Defunctionalization
DEFF Research Database (Denmark)
Biernacki, Dariusz; Danvy, Olivier
2004-01-01
Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lam......Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied...
From Interpreter to Logic Engine by Defunctionalization
DEFF Research Database (Denmark)
Biernacki, Dariusz; Danvy, Olivier
2003-01-01
Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lam......Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied...
From Interpreter to logic Engine by Defunctionalization
DEFF Research Database (Denmark)
Biernacki, Dariusz; Danvy, Olivier
2003-01-01
Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lam......Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied...
Paraconsistent Computational Logic
DEFF Research Database (Denmark)
Jensen, Andreas Schmidt; Villadsen, Jørgen
2012-01-01
In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study.......In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....
Three-valued logics in modal logic
Kooi, Barteld; Tamminga, Allard
2013-01-01
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we
Amini, Ata; Shrimpton, Paul J; Muggleton, Stephen H; Sternberg, Michael J E
2007-12-01
Despite the increased recent use of protein-ligand and protein-protein docking in the drug discovery process due to the increases in computational power, the difficulty of accurately ranking the binding affinities of a series of ligands or a series of proteins docked to a protein receptor remains largely unsolved. This problem is of major concern in lead optimization procedures and has lead to the development of scoring functions tailored to rank the binding affinities of a series of ligands to a specific system. However, such methods can take a long time to develop and their transferability to other systems remains open to question. Here we demonstrate that given a suitable amount of background information a new approach using support vector inductive logic programming (SVILP) can be used to produce system-specific scoring functions. Inductive logic programming (ILP) learns logic-based rules for a given dataset that can be used to describe properties of each member of the set in a qualitative manner. By combining ILP with support vector machine regression, a quantitative set of rules can be obtained. SVILP has previously been used in a biological context to examine datasets containing a series of singular molecular structures and properties. Here we describe the use of SVILP to produce binding affinity predictions of a series of ligands to a particular protein. We also for the first time examine the applicability of SVILP techniques to datasets consisting of protein-ligand complexes. Our results show that SVILP performs comparably with other state-of-the-art methods on five protein-ligand systems as judged by similar cross-validated squares of their correlation coefficients. A McNemar test comparing SVILP to CoMFA and CoMSIA across the five systems indicates our method to be significantly better on one occasion. The ability to graphically display and understand the SVILP-produced rules is demonstrated and this feature of ILP can be used to derive hypothesis for
DEFF Research Database (Denmark)
Carbone, Marco; Montesi, Fabrizio; Schürmann, Carsten
2014-01-01
In Choreographic Programming, a distributed system is programmed by giving a choreography, a global description of its interactions, instead of separately specifying the behaviour of each of its processes. Process implementations in terms of a distributed language can then be automatically...
DEFF Research Database (Denmark)
Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume i...... epistemic logic, and the logic of evidence.......Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume...... is the proceedings of the conference of record in its fi eld, Advances in Modal Logic. Its contributions are state-of-the-art papers. The topics include decidability and complexity results for specifi c modal logics, proof theory of modal logic, logics for reasoning about time and space, provability logic, dynamic...
The PLATO Dome A site-testing observatory: Power generation and control systems
Lawrence, J. S.; Ashley, M. C. B.; Hengst, S.; Luong-van, D. M.; Storey, J. W. V.; Yang, H.; Zhou, X.; Zhu, Z.
2009-06-01
The atmospheric conditions above Dome A, a currently unmanned location at the highest point on the Antarctic plateau, are uniquely suited to astronomy. For certain types of astronomy Dome A is likely to be the best location on the planet, and this has motivated the development of the Plateau Observatory (PLATO). PLATO was deployed to Dome A in early 2008. It houses a suite of purpose-built site-testing instruments designed to quantify the benefits of Dome A site for astronomy, and science instruments designed to take advantage of the observing conditions. The PLATO power generation and control system is designed to provide continuous power and heat, and a high-reliability command and communications platform for these instruments. PLATO has run and collected data throughout the winter 2008 season completely unattended. Here we present a detailed description of the power generation, power control, thermal management, instrument interface, and communications systems for PLATO, and an overview of the system performance for 2008.
Gaia and WEAVE/WxES: Supporting the PLATO Exoplanet Hunter
Walton, N. A.
2016-10-01
This paper briefly describes the powerful linkages between the Gaia and PLATO missions and the potential for WEAVE in the study of exoplanet populations, for instance through the proposed WxES survey. Gaia successfully launched in December 2013, and over the course of its nominal five year mission will discover, via their astrometric signatures, upwards of 20 000 massive Jupiter sized long period planets at distances out to several hundred parsecs around all star types. In addition Gaia will discover up to a thousand short period hot Jupiters around M stars. PLATO, to launch in 2024, will through precision photometry, observe in detail some million host stars, and will detect, via the transit technique, planets down to Earth masses. PLATO will observe two fields of over 2 000 square degrees for 2-3 years each. At least one of these will be in the northern hemisphere. WEAVE has the potential to provide detailed chemical characterization of the host stars of the Gaia and PLATO exoplanet systems. This will enable insights into, for instance, metallicity of the host star correlations against both massive exoplanets (perhaps confirming current relationships), and lower mass exoplanets. We note how the rapid exploitation of such a potential WEAVE survey could be achieved, utilizing the WEAVE processing systems being developed at the IoA, Cambridge, coupled with efficient interfaces to both Gaia and PLATO data products, that are also being generated at the IoA.
Kats, L.C.; Visser, E.
2010-01-01
Software platforms such as the Java Virtual Machine or the CLR .NET virtual machine have their own ecosystem of a core programming language or instruction set, libraries, and developer community. Programming languages can target multiple software platforms to increase interoperability or to boost pe
Kats, L.C.; Visser, E.
2010-01-01
Software platforms such as the Java Virtual Machine or the CLR .NET virtual machine have their own ecosystem of a core programming language or instruction set, libraries, and developer community. Programming languages can target multiple software platforms to increase interoperability or to boost
DEFF Research Database (Denmark)
Gallagher, John Patrick; Puebla, G.
2002-01-01
Set-based program analysis has many potential applications, including compiler optimisations, type-checking, debugging, verification and planning. One method of set-based analysis is to solve a set of {\\it set constraints} derived directly from the program text. Another approach is based on abstr...
Advanced Control Techniques with Fuzzy Logic
2014-06-01
AFRL-RQ-WP-TR-2014-0175 ADVANCED CONTROL TECHNIQUES WITH FUZZY LOGIC James E. Combs Structural Validation Branch Aerospace Vehicles...TECHNIQUES WITH FUZZY LOGIC 5a. CONTRACT NUMBER In-house 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 62201F 6. AUTHOR(S) James E. Combs...unlimited. 13. SUPPLEMENTARY NOTES PA Case Number: 88ABW-2014-3281; Clearance Date: 09 Jul 2014. 14. ABSTRACT Research on the Fuzzy Logic control
Clapham, Kathleen; Manning, Claire; Williams, Kathryn; O'Brien, Ginger; Sutherland, Margaret
2017-04-01
Despite clear evidence that learning and social opportunities for children with disabilities and special needs are more effective in inclusive not segregated settings, there are few known effective inclusion programs available to children with disabilities, their families or teachers in the early years within Australia. The Kids Together program was developed to support children with disabilities/additional needs aged 0-8 years attending mainstream early learning environments. Using a key worker transdisciplinary team model, the program aligns with the individualised package approach of the National Disability Insurance Scheme (NDIS).
Probabilistic Dynamic Epistemic Logic
Kooi, B.P.
2003-01-01
In this paper I combine the dynamic epistemic logic of Gerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1999). The result is a new probabilistic dynamic epistemic logic, a logic for reasoning about probability, information, and information change that takes higher order informatio
The role of the poet in Plato's ideal cities of Callipolis and Magnesia
Directory of Open Access Journals (Sweden)
Gerard Naddaf
2008-01-01
Full Text Available Plato's attitude toward the poets and poetry has always been a flashpoint of debate, controversy and notoriety, but most scholars have failed to see their central role in the ideal cities of the Republic and the Laws, that is, Callipolis and Magnesia. In this paper, I argue that in neither dialogue does Plato "exile" the poets, but, instead, believes they must, like all citizens, exercise the expertise proper to their profession, allowing them the right to become full-fledged participants in the productive class. Moreover, attention to certain details reveals that Plato harnesses both positive and negative factors in poetry to bring his ideal cities closer to a practical realization. The status of the poet and his craft in this context has rarely to my knowledge been addressed.
PLATO - the next-generation AASTINO for robotic site-testing on the Antarctic plateau
Hengst, S.; Lawrence, J.; Luong-van, D.; Everett, J.; Ashley, M. C. B.; Storey, J. W. V.; Hall, S.
2006-08-01
A new site-testing facility, PLATO (Plateau Observatory), is under development at UNSW for deployment to remote sites on the Antarctic Plateau including Dome A. The new facility will adopt many of the features of the AASTINO (Automated Astrophysical Site Testing InterNational Observatory) facility at Dome C. PLATO will autonomously control a flexible site testing and observing instrument suite, monitored via the Iridium satellite network. A challenging aspect of PLATO is to maximise the reliability of the power source while minimising fuel consumption. We are building a low pressure, low temperature environmental chamber to simulate operation at the highest altitudes (4,100 m at Dome A). Two types of engines will be tested: a single-cylinder diesel engine and a Stirling engine.
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
have a tendency correctly to assess valid syllogisms as such more often than correctly assessing invalid syllogisms as such. It is also investigated to what extent the students have improved their skills in practical reasoning by attending the logic courses. Finally, some open questions regarding......This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy students...... and two groups of students of informatics. The skills of the students in syllogistic reasoning before and after the logic courses have been studied and are discussed. The empirical observations made with the program make it possible to identify syllogisms which are found difficult by the students...
Metamathematics of fuzzy logic
Hájek, Petr
1998-01-01
This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. Some important systems of real-valued propositional and predicate calculus are defined and investigated. The aim is to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named `fuzzy inference' can be naturally understood as logical deduction.
DEFF Research Database (Denmark)
Bentzen, Martin Mose
2014-01-01
A new deontic logic, Action Type Deontic Logic, is presented. To motivate this logic, a number of benchmark cases are shown, representing inferences a deontic logic should validate. Some of the benchmark cases are singled out for further comments and some formal approaches to deontic reasoning ar...... the benchmarks. Finally, possibilities for further research are indicated. In the appendix, decidability of the satisfiability of formulas is proved via a technique known from monadic First Order Logic....
The quest for a poetics of goodness in plato and aristotle
Dairo Orozco
2012-01-01
The paper, which compares Plato and Aristotle’s different approaches towards artistic activity, is divided into three parts. The first part discusses Plato’s Ion on mimesis and technē, as well as the role that poetry plays in the Republic. The second section offers an account of Aristotle’s idea of happiness as the end of action. Thelast section of this study deals with an attempt to reconcile Plato and Aristotle’s attitude towards mimetic art in a treatise by a Neoplatonic renaissance thinke...
A Similar Comparison between the Thought of Plato and Confucius on Social Hierarchy and Elitism
Institute of Scientific and Technical Information of China (English)
杨馥遥
2014-01-01
The spring-autumn period and warring state period of Chinese thoughts coincide strikingly with the thoughts of the Hel enic Age in the west. Plato and Confucius, the two outstanding seminal thinkers have shaped the philosophy of their respective cultures through some similar means and thoughts which definitely meet at a series of significant points. The highlight of the academic thesis lies in the comparison of the general similarities be-tween Plato and Confucius especial y in terms of social hierarchy and elitism.
Amortised Resource Analysis with Separation Logic
Atkey, Robert
2011-01-01
Type-based amortised resource analysis following Hofmann and Jost---where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline---have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imperative pointer-manipulating languages by embedding a logic of resources, based on the affine intuitionistic Logic of Bunched Implications, within Separation Logic. The Separation Logic component allows us to assert the presence and shape of mutable data structures on the heap, while the resource component allows us to state the consumable resources associated with each member of the structure. We present the logic on a small imperative language, based on Java bytecode, with procedures and mutable heap. We have formalised the logic and its soundness property within the Coq proof assistant and extracted a certified ver...
Towards applied theories based on computability logic
Japaridze, Giorgi
2008-01-01
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Formulas in it represent computational problems, "truth" means existence of an algorithmic solution, and proofs encode such solutions. Within the line of research devoted to finding axiomatizations for ever more expressive fragments of CL, the present paper introduces a new deductive system CL12 and proves its soundness and completeness with respect to the semantics of CL. Conservatively extending classical predicate calculus and offering considerable additional expressive and deductive power, CL12 presents a reasonable, computationally meaningful, constructive alternative to classical logic as a basis for applied theories. To obtain a model example of such theories, this paper rebuilds the traditional, classical-logic-based Peano arithmetic into a computability-logic-b...
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy student...
DEFF Research Database (Denmark)
Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker
2012-01-01
We present a logical relation for showing the correctness of program transformations based on a new type-and-eﬀect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number...... of interesting program transformations that rely on eﬀect annotations. In particular, we prove a Parallelization Theorem, which expresses when it is sound to run two expressions in parallel instead of sequentially. The conditions are expressed solely in terms of the types and eﬀects of the expressions....... To the best of our knowledge, this is the ﬁrst such result for a concurrent higher-order language with higher-order store and dynamic memory allocation....
Zima, W; De Ridder, J; Salmon, S; Catala, C; Kjeldsen, H; Aerts, C
2010-01-01
The PLATO satellite mission project is a next generation ESA Cosmic Vision satellite project dedicated to the detection of exo-planets and to asteroseismology of their host-stars using ultra-high precision photometry. The main goal of the PLATO mission is to provide a full statistical analysis of exo-planetary systems around stars that are bright and close enough for detailed follow-up studies. Many aspects concerning the design trade-off of a space-based instrument and its performance can best be tackled through realistic simulations of the expected observations. The complex interplay of various noise sources in the course of the observations made such simulations an indispensable part of the assessment study of the PLATO Payload Consortium. We created an end-to-end CCD simulation software-tool, dubbed PLATOSim, which simulates photometric time-series of CCD images by including realistic models of the CCD and its electronics, the telescope optics, the stellar field, the pointing uncertainty of the satellite ...
Contribution of Warsaw Logicians to Computational Logic
Directory of Open Access Journals (Sweden)
Damian Niwiński
2016-06-01
Full Text Available The newly emerging branch of research of Computer Science received encouragement from the successors of the Warsaw mathematical school: Kuratowski, Mazur, Mostowski, Grzegorczyk, and Rasiowa. Rasiowa realized very early that the spectrum of computer programs should be incorporated into the realm of mathematical logic in order to make a rigorous treatment of program correctness. This gave rise to the concept of algorithmic logic developed since the 1970s by Rasiowa, Salwicki, Mirkowska, and their followers. Together with Pratt’s dynamic logic, algorithmic logic evolved into a mainstream branch of research: logic of programs. In the late 1980s, Warsaw logicians Tiuryn and Urzyczyn categorized various logics of programs, depending on the class of programs involved. Quite unexpectedly, they discovered that some persistent open questions about the expressive power of logics are equivalent to famous open problems in complexity theory. This, along with parallel discoveries by Harel, Immerman and Vardi, contributed to the creation of an important area of theoretical computer science: descriptive complexity. By that time, the modal μ-calculus was recognized as a sort of a universal logic of programs. The mid 1990s saw a landmark result by Walukiewicz, who showed completeness of a natural axiomatization for the μ-calculus proposed by Kozen. The difficult proof of this result, based on automata theory, opened a path to further investigations. Later, Bojanczyk opened a new chapter by introducing an unboundedness quantifier, which allowed for expressing some quantitative properties of programs. Yet another topic, linking the past with the future, is the subject of automata founded in the Fraenkel-Mostowski set theory. The studies on intuitionism found their continuation in the studies of Curry-Howard isomorphism. ukasiewicz’s landmark idea of many-valued logic found its continuation in various approaches to incompleteness and uncertainty.
DEFF Research Database (Denmark)
Schürmann, Carsten; Sarnat, Jeffrey
2008-01-01
, such as Twelf, and yet they are often straightforward in proof assistants with stronger meta-logics. In this paper, we propose structural logical relations as a technique for conducting these proofs in systems with limited meta-logical strength by explicitly representing and reasoning about an auxiliary logic......Tait's method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed lambda-calculi. Historically, these proofs have been extremely difficult to formalize in proof assistants with weak meta-logics...
Sequential operators in computability logic
Japaridze, Giorgi
2007-01-01
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more traditionally been. Formulas in CL stand for (interactive) computational problems, understood as games between a machine and its environment; logical operators represent operations on such entities; and "truth" is understood as existence of an effective solution, i.e., of an algorithmic winning strategy. The formalism of CL is open-ended, and may undergo series of extensions as the study of the subject advances. The main groups of operators on which CL has been focused so far are the parallel, choice, branching, and blind operators. The present paper introduces a new important group of operators, called sequential. The latter come in the form of sequential conjunction and disjunction, sequential quantifiers, and sequential recurrences. As the name may suggest, the algorithmic ...
ST-elevation acute coronary syndromes in the Platelet Inhibition and Patient Outcomes (PLATO) trial
DEFF Research Database (Denmark)
Armstrong, Paul W; Siha, Hany; Fu, Yuling;
2012-01-01
Ticagrelor, when compared with clopidogrel, reduced the 12-month risk of vascular death/myocardial infarction and stroke in patients with ST-elevation acute coronary syndromes intended to undergo primary percutaneous coronary intervention in the PLATelet inhibition and patient Outcomes (PLATO) tr...
Democratic Freedom and the Concept of Freedom in Plato and Aristotle
Directory of Open Access Journals (Sweden)
Mogens Herman Hansen
2010-11-01
Full Text Available Among the several meanings of eleutheria used by Greeks in the classical period, democratic freedom is rejected by both Plato and Aristotle, who do not articulate a theory of political freedom but rather confine eleutheria to a social context.
Dialectic of Eros and Myth of the Soul in Plato's Phaedrus
DEFF Research Database (Denmark)
Larsen, Jens Kristian
2010-01-01
In this paper, I question a widespread reading of a passage in the last part of the Phaedrus dealing with the science of dialectic. According to this reading, the passage announces a new method peculiar to the later Plato aiming at defining natural kinds. I show that the Phaedrus itself does not ...
Evaluation of a Three Year Health Sciences PLATO IV Computer-Based Education Project.
Sorlie, William E.; Essex, Diane L.
Significant findings of the comprehensive evaluation of a computer-based curriculum in the basic medical sciences using the PLATO IV computer system are presented. The study was conducted by the Office of Curriculum and Evaluation (OCE) of the School of Basic Medical Sciences (SBMS) at the University of Illinois, Urbana/Champaign (UC). It was…
From Dialogos to Dialogue: The Use of the Term from Plato to the Second Century CE
Directory of Open Access Journals (Sweden)
Katarzyna Jazdzewska
2014-02-01
Full Text Available In Plato the verb διαλέγεσθαι is far more common than the noun, and both denote question-and-answer discussions; it was only in the Hellenistic period that διάλογος became a genre term, though its other meanings survived.
Two examples of the relation between the contemporary science and Plato
Antonello, Elio
2016-01-01
The philosopher Plato is remembered even today by scientists, and his writings are still inspiring the scientific research. In the present short note (intended essentially for public outreach) two examples are briefly illustrated: 1) the European space project that bears his name, dedicated to the discovery of exoplanets; 2) the discussion about platonism in contemporary physics.
Friedman, Lawrence B.
Taking a philosophical approach based on what Plato, Aristotle, and Descartes said about knowledge, this paper addresses some of the murkiness in the conceptual space surrounding the issue of whether prior knowledge does or does not facilitate text comprehension. Specifically, the paper first develops a non-exhaustive typology of cases in which…
Shim, Seung Hwan
2008-01-01
This study proposes the ideal role of teachers through the examination of Plato, Confucius, Buber, and Freire on the subject. Teachers not only contribute to the development of individuals and societies but also attain self-realization through teaching. As such, the role of teachers is important as a goal as well as a means. To examine such role,…
Genesis 2–3 and Alcibiades's speech in Plato's Symposium: A ...
African Journals Online (AJOL)
2015-08-26
Aug 26, 2015 ... Friedländer 1975:26f; Gauss 1958:111–117) is the last speech in Plato's ... leader (450–404/3 BCE), appears to be in a great state of intoxication .... command (Gn 2:18: 'You are free to eat of all the trees in the garden.
From Plato to Erikson: How the War on "Bad Play" Has Impoverished Higher Education
Carnes, Mark C.
2015-01-01
For centuries, the titans of educational reform--Plato, Rousseau, Dewey, Piaget, Erikson, Csikszentmihalyi and others--have championed the educational benefits of play. Yet many professors and administrators are boggled by the idea of playing academic games in college. They instantly dismiss faculty initiatives like "Reacting to the…
A Survey of Paraconsistent Logics
Middelburg, C A
2011-01-01
A survey of paraconsistent logics that are prominent representatives of the different approaches that have been followed to develop paraconsistent logics is provided. The paraconsistent logics that will be discussed are an enrichment of Priest's logic LP, the logic RM3 from the school of relevance logic, da Costa's logics Cn, Jaskowski's logic D2, and Subrahmanian's logics Ptau. A deontic logic based on the first of these logics will be discussed as well. Moreover, some proposed adaptations of the AGM theory of belief revision to paraconsistent logics will be mentioned.
Enabling Concise and Modular Specifications in Separation Logic
DEFF Research Database (Denmark)
Jensen, Jonas Buhrkal
2014-01-01
Separation logic is an extension of Hoare logic for reasoning about programs that use pointers or references to potentially-shared data. The problem with such programs, both in formal proofs and in informal understanding of them, is to know not only what data they change but also to know what data...... they leave unmodified. Separation logic has one simple general answer to this, known as the frame rule; it intuitively says that all data that is disjoint from the minimal footprint of the program will be unmodified. This thesis is a collection of papers with the common theme of presenting new separation...... logics and examples of using these logics to verify challenging programs. The article Modular Verification of Linked Lists with Views via Separation Logic reports on verification of a practical data structure with separation logic. The challenges identified in this work has served as motivation for later...
Magnetic Logic Circuits for Extreme Environments Project
National Aeronautics and Space Administration — The program aims to demonstrate a new genre of all-magnetic logic circuits which are radiation-tolerant and capable of reliable operation in extreme environmental...
Directory of Open Access Journals (Sweden)
Xoán C Pardo
2006-01-01
Full Text Available En este artículo se describen las principales funcionalidades y aspectos destacados del diseño y desarrollo de un entorno para la emulación de autómatas programables. El objetivo de este trabajo ha sido disponer de un emulador que, siendo compatible con las especificaciones del estándar IEC 61131-3, proporcionase características adicionales como el acceso remoto, la definición de conjuntos diferentes de instrucciones mediante el uso de catálogos, y la configuración de diferentes arquitecturas hardware. En su implementación se han aplicado tecnologías software abiertas y se ha diseñado una interfaz gráfica de usuario para navegadores web. Esto garantiza la portabilidad y accesibilidad del emulador.The main functionalities and characteristics of a new application for the emulation of Programmable Logic Controllers are described in this paper. The objective of this work has been to design and implement an emulator including among others the following characteristics: to comply with the IEC 61131-3 standard, to allow remote access, to allow configuration of different instruction sets based on the use of catalogs, and to allow configuration of different hardware architectures. Open source technologies have been used for the implementation of the emulator and a graphic interface to be used by web browsers has been incorporated. This guaranties the portability and accessibility of the emulator.
An Argumentation-Based Framework for Extended Disjunctive Logic Programs%扩充析取逻辑程序的争论语义
Institute of Scientific and Technical Information of China (English)
王克文; 周立柱; 陈火旺
2000-01-01
该文探讨争论推理在扩充逻辑程序中的实现及其关系问题.基于"相干原理",建立了扩充逻辑程序的争论推理框架,多种争论推理形式都可以嵌入其中.特别是提出了一种谨慎语义Acc.同时又定义了良基语义的一种合理扩充Mod,以处理较为大胆的推理形式.另外也研究了相关的理论性质.%An investigation into the relationship between argumentation and disjunctive logic programs with explicit negation (EDLP) is conducted.By employing the coherence principle,an argumentation-theoretic framework for EDLP is presented,in which various forms of argumentation can be performed.In particular,a skeptical semantics Acc is introduced in a natural way.To provide a more suitable form of argumentation,a less skeptical semantics Mod is also defined which naturally extends the well-founded model.
Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing
Luo, Zhaochu
2016-11-16
In the magnetic logic, four basic Boolean logic operations can be programmed by a magnetic bit at room temperature with a high output ratio (>103%). In the same clock cycle, benefiting from the built-in spin Hall effect, logic results can be directly written into magnetic bits using an all-electric method.
Newton-Smith, WH
2003-01-01
A complete introduction to logic for first-year university students with no background in logic, philosophy or mathematics. In easily understood steps it shows the mechanics of the formal analysis of arguments.
Bolc, Leonard
1992-01-01
Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of excluded middle" in classical logic. The first many-valued formal systems were developed by J. Lukasiewicz in Poland and E.Post in the U.S.A. in the 1920s, and since then the field has expanded dramatically as the applicability of the systems to other philosophical and semantic problems was recognized. Intuitionisticlogic, for example, arose from deep problems in the foundations of mathematics. Fuzzy logics, approximation logics, and probability logics all address questions that classical logic alone cannot answer. All these interpretations of many-valued calculi motivate specific formal systems thatallow detailed mathematical treatment. In this volume, the authors are concerned with finite-valued logics, and especially with three-valued logical calculi. Matrix constructions, axiomatizations of propositional and predicate calculi, syntax, semantic structures, and methodology are discussed. Separate chapters deal w...
Symbolic logic and mechanical theorem proving
Chang, Chin-Liang
1969-01-01
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Yang, Fan; Väänänen, Jouko
2016-01-01
We consider team semantics for propositional logic, continuing our previous work (Yang & V\\"a\\"an\\"anen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an individual valuation. This offers the possibility to give meaning to concepts such as dependence, independence and inclusion. We define an expressively maximal propositional team logic, called full propositional team logic. This requires going beyond the logic...
DEFF Research Database (Denmark)
Aiello, Marco; Bezhanishvili, Guram; Bloch, Isabelle
2012-01-01
of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones in the logical representation of space and investigate current trends. In doing so......, we do not only consider classical logic, but we indulge ourselves with modal logics. These present themselves naturally by providing simple axiomatizations of different geometries, topologies, space-time causality, and vector spaces....
Institutional Logics in Action
DEFF Research Database (Denmark)
Lounsbury, Michael; Boxenbaum, Eva
2013-01-01
This double volume presents state-of-the-art research and thinking on the dynamics of actors and institutional logics. In the introduction, we briefly sketch the roots and branches of institutional logics scholarship before turning to the new buds of research on the topic of how actors engage ins...... prolific stream of research on institutional logics by deepening our insight into the active use of institutional logics in organizational action and interaction, including the institutional effects of such (inter)actions....
Hierarchies in Dependence Logic
Durand, Arnaud
2011-01-01
We study fragments of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these fragments of dependence logic. We also show that these both ways of defining fragments of dependence logic give rise to a hierarchy in expressive power with respect to k.
Institute of Scientific and Technical Information of China (English)
刘叙华; 邓安生
1994-01-01
A new approach of operator fuzzy logic, Boolean operator fuzzy logic (BOFL) based on Boolean algebra, is presented. The resolution principle is also introduced into BOFL. BOFL is a natural generalization of classical logic and can be applied to the qualitative description of fuzzy knowledge.
DEFF Research Database (Denmark)
Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian
2015-01-01
We introduce Concurrent Weighted Logic (CWL), a multimodal logic for concurrent labeled weighted transition systems (LWSs). The synchronization of LWSs is described using dedicated functions that, in various concurrency paradigms, allow us to encode the compositionality of LWSs. To reflect these......-completeness results for this logic. To complete these proofs we involve advanced topological techniques from Model Theory....
DEFF Research Database (Denmark)
Berg Johansen, Christina; Waldorff, Susanne Boch
This study presents new insights into the explanatory power of the institutional logics perspective. With outset in a discussion of seminal theory texts, we identify two fundamental topics that frame institutional logics: overarching institutional orders guides by institutional logics, as well...
DEFF Research Database (Denmark)
Jantzen, Jan
1998-01-01
A logic based on the two truth values True and False is sometimes inadequate when describing human reasoning. Fuzzy logic uses the whole interval between 0 (False) and 1 (True) to describe human reasoning. As a result, fuzzy logic is being applied in rule based automatic controllers, and this paper...
Regular database update logics
Spruit, Paul; Wieringa, Roel; Meyer, John-Jules
2001-01-01
We study regular first-order update logic (FUL), which is a variant of regular dynamic logic in which updates to function symbols as well as to predicate symbols are possible. We fi1rst study FUL without making assumptions about atomic updates. Second, we look at relational algebra update logic (RAU
Uckelman, S.L.
2009-01-01
This dissertation is an exercise in conceptual archeology. Using the tools of contemporary logic we analyse texts in medieval logic and reconstruct their logical theories by creating a formal framework which models them. Our focus is medieval texts which deal with various modalities: the writings on
An interval logic for higher-level temporal reasoning
Schwartz, R. L.; Melliar-Smith, P. M.; Vogt, F. H.; Plaisted, D. A.
1983-01-01
Prior work explored temporal logics, based on classical modal logics, as a framework for specifying and reasoning about concurrent programs, distributed systems, and communications protocols, and reported on efforts using temporal reasoning primitives to express very high level abstract requirements that a program or system is to satisfy. Based on experience with those primitives, this report describes an Interval Logic that is more suitable for expressing such higher level temporal properties. The report provides a formal semantics for the Interval Logic, and several examples of its use. A description of decision procedures for the logic is also included.
DEFF Research Database (Denmark)
Christiansen, Henning; Dahl, Veronica
2009-01-01
By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting....... We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also -- in a significant departure from...
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Huertas, Antonia; Manzano, Maria;
2014-01-01
Leon Henkin was not a modal logician, but there is a branch of modal logic that has been deeply influenced by his work. That branch is hybrid logic, a family of logics that extend orthodox modal logic with special proposition symbols (called nominals) that name worlds. This paper explains why...... Henkin’s techniques are so important in hybrid logic. We do so by proving a completeness result for a hybrid type theory called HTT, probably the strongest hybrid logic that has yet been explored. Our completeness result builds on earlier work with a system called BHTT, or basic hybrid type theory...... is due to the first-order perspective, which lies at the heart of Henin’s best known work and hybrid logic....
Flow Logic for Process Calculi
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Nielson, Flemming; Pilegaard, Henrik
2012-01-01
Flow Logic is an approach to statically determining the behavior of programs and processes. It borrows methods and techniques from Abstract Interpretation, Data Flow Analysis and Constraint Based Analysis while presenting the analysis in a style more reminiscent of Type Systems. Traditionally...... developed for programming languages, this article provides a tutorial development of the approach of Flow Logic for process calculi based on a decade of research. We first develop a simple analysis for the π-calculus; this consists of the specification, semantic soundness (in the form of subject reduction...... and adequacy results), and a Moore Family result showing that a least solution always exists, as well as providing insights on how to implement the analysis. We then show how to strengthen the analysis technology by introducing reachability components, interaction points, and localized environments...
Magnetic-field-controlled reconfigurable semiconductor logic.
Joo, Sungjung; Kim, Taeyueb; Shin, Sang Hoon; Lim, Ju Young; Hong, Jinki; Song, Jin Dong; Chang, Joonyeon; Lee, Hyun-Woo; Rhie, Kungwon; Han, Suk Hee; Shin, Kyung-Ho; Johnson, Mark
2013-02-07
Logic devices based on magnetism show promise for increasing computational efficiency while decreasing consumed power. They offer zero quiescent power and yet combine novel functions such as programmable logic operation and non-volatile built-in memory. However, practical efforts to adapt a magnetic device to logic suffer from a low signal-to-noise ratio and other performance attributes that are not adequate for logic gates. Rather than exploiting magnetoresistive effects that result from spin-dependent transport of carriers, we have approached the development of a magnetic logic device in a different way: we use the phenomenon of large magnetoresistance found in non-magnetic semiconductors in high electric fields. Here we report a device showing a strong diode characteristic that is highly sensitive to both the sign and the magnitude of an external magnetic field, offering a reversible change between two different characteristic states by the application of a magnetic field. This feature results from magnetic control of carrier generation and recombination in an InSb p-n bilayer channel. Simple circuits combining such elementary devices are fabricated and tested, and Boolean logic functions including AND, OR, NAND and NOR are performed. They are programmed dynamically by external electric or magnetic signals, demonstrating magnetic-field-controlled semiconductor reconfigurable logic at room temperature. This magnetic technology permits a new kind of spintronic device, characterized as a current switch rather than a voltage switch, and provides a simple and compact platform for non-volatile reconfigurable logic devices.
The Relationship Between Separation Logic and Implicit Dynamic Frames
Parkinson, Matthew J
2012-01-01
Separation logic is a concise method for specifying programs that manipulate dynamically allocated storage. Partially inspired by separation logic, Implicit Dynamic Frames has recently been proposed, aiming at first-order tool support. In this paper, we precisely connect the semantics of these two logics. We define a logic whose syntax subsumes both that of a standard separation logic, and that of implicit dynamic frames as sub-syntaxes. We define a total heap semantics for our logic, and, for the separation logic subsyntax, prove it equivalent the standard partial heaps model. In order to define a semantics which works uniformly for both subsyntaxes, we define the novel concept of a minimal state extension, which provides a different (but equivalent) definition of the semantics of separation logic implication and magic wand connectives, while also giving a suitable semantics for these connectives in implicit dynamic frames. We show that our resulting semantics agrees with the existing definition of weakest p...
A pointer logic and certifying compiler
Institute of Scientific and Technical Information of China (English)
CHEN Yiyun; GE Lin; HUA Baojian; LI Zhaopeng; LIU Cheng; WANG Zhifang
2007-01-01
Proof-Carrying Code brings two big challenges to the research field of programming languages.One is to seek more expressive logics or type systems to specify or reason about the properties of low-level or high-level programs.The other is to study the technology of certifying compilation in which the compiler generates proofs for programs with annotations.This paper presents our progress in the above two aspects.A pointer logic was designed for PointerC (a C-like programming language) in our research.As an extension of Hoare logic,our pointer logic expresses the change of pointer information for each statement in its inference rules to support program verification.Meanwhile,based on the ideas from CAP (Certified Assembly Programming) and SCAP (Stack-based Certified Assembly Programming),a reasoning framework was built to verify the properties of object code in a Hoare style.And a certifying compiler prototype for PointerC was implemented based on this framework.The main contribution of this paper is the design of the pointer logic and the implementation of the certifying compiler prototype.In our certifying compiler,the source language contains rich pointer types and operations and also supports dynamic storage allocation and deallocation.
Session Types in Abelian Logic
Directory of Open Access Journals (Sweden)
Yoichi Hirai
2013-12-01
Full Text Available There was a PhD student who says "I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes." We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky's linear lambda calculus LF and characterizes Abelian logic.
Philosophical, logical and scientific perspectives in engineering
Sen, Zekâi
2013-01-01
This book highlights and explains the significance of philosophical, logical, and scientific principles for engineering education/training and engineering works. In so doing, it aims to help to rectify the neglect of philosophy and logic in current education and training programs, which emphasize analytical and numerical methods at the expense of the innovative practical and creative abilities so important for engineering in the past. Individual chapters examine the relation of philosophy, logic, and science to engineering, drawing attention to, for example, the significance of ethics, the rel
Abductive Inference using Array-Based Logic
DEFF Research Database (Denmark)
Frisvad, Jeppe Revall; Falster, Peter; Møller, Gert L.;
The notion of abduction has found its usage within a wide variety of AI fields. Computing abductive solutions has, however, shown to be highly intractable in logic programming. To avoid this intractability we present a new approach to logicbased abduction; through the geometrical view of data...... employed in array-based logic we embrace abduction in a simple structural operation. We argue that a theory of abduction on this form allows for an implementation which, at runtime, can perform abductive inference quite efficiently on arbitrary rules of logic representing knowledge of finite domains....
Dalen, Dirk
1983-01-01
A book which efficiently presents the basics of propositional and predicate logic, van Dalen’s popular textbook contains a complete treatment of elementary classical logic, using Gentzen’s Natural Deduction. Propositional and predicate logic are treated in separate chapters in a leisured but precise way. Chapter Three presents the basic facts of model theory, e.g. compactness, Skolem-Löwenheim, elementary equivalence, non-standard models, quantifier elimination, and Skolem functions. The discussion of classical logic is rounded off with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, one chapter is devoted to intuitionistic logic. Completeness is established for Kripke semantics. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property have been incorporated. The power and elegance of natural deduction is demonstrated best in the part of proof theory cal...
Plato, Wilde, and Woolf: the poetics of homoerotic "intercourse" in A Room of One's Own.
Vanita, Ruth
2010-01-01
This article places Woolf in the context of homoerotic literary ancestry. It suggests that the overall argument in A Room of One's Own owes a debt to Wilde's 1891 pamphlet The Soul of Man under Socialism. It also examines Woolf's controversial meditation on male-female collaboration and intercourse in A Room, and suggests a homoerotic reading of this meditation, drawing on images and ideas of literary transmission and creation from Plato's Symposium.
The philosopher Socrates had exophthalmos (a term coined by Plato) and probably Graves' disease.
Papapetrou, Peter D
2015-01-01
According to a previously published theory, Socrates was afflicted with temporal lobe epilepsy since his childhood. Plato, Xenophon, and Aristoxenus described Socrates as having exophthalmos, probably diplopia, and some symptoms compatible with hyperthyroidism. Using these data, we theorize that Socrates had Graves' disease. In order to determine a cause of his temporal lobe epilepsy, we speculate that the philosopher also had autoimmune thyroiditis and Hashimoto encephalopathy during his childhood and his epilepsy may have been a sequel to this hypothesized encephalopathy.
Logical database design principles
Garmany, John; Clark, Terry
2005-01-01
INTRODUCTION TO LOGICAL DATABASE DESIGNUnderstanding a Database Database Architectures Relational Databases Creating the Database System Development Life Cycle (SDLC)Systems Planning: Assessment and Feasibility System Analysis: RequirementsSystem Analysis: Requirements Checklist Models Tracking and Schedules Design Modeling Functional Decomposition DiagramData Flow Diagrams Data Dictionary Logical Structures and Decision Trees System Design: LogicalSYSTEM DESIGN AND IMPLEMENTATION The ER ApproachEntities and Entity Types Attribute Domains AttributesSet-Valued AttributesWeak Entities Constraint
2009-01-01
This dissertation is an exercise in conceptual archeology. Using the tools of contemporary logic we analyse texts in medieval logic and reconstruct their logical theories by creating a formal framework which models them. Our focus is medieval texts which deal with various modalities: the writings on alethic modalities by William of Sherwood, Pseudo-Aquinas, and St. Thomas Aquinas in the 13th century, St. Anselm of Canterbury’s writings on facere and debere in the late 11th century; Lambert of...
Separation Logic and Concurrency
Bornat, Richard
Concurrent separation logic is a development of Hoare logic adapted to deal with pointers and concurrency. Since its inception, it has been enhanced with a treatment of permissions to enable sharing of data between threads, and a treatment of variables as resource alongside heap cells as resource. An introduction to the logic is given with several examples of proofs, culminating in a treatment of Simpson's 4-slot algorithm, an instance of racy non-blocking concurrency.
Introduction to mathematical logic
Mendelson, Elliott
2015-01-01
The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.The sixth edition incorporates recent work on Gödel's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition. It is offered in th
Crossley, J N; Brickhill, CJ; Stillwell, JC
2010-01-01
Although mathematical logic can be a formidably abstruse topic, even for mathematicians, this concise book presents the subject in a lively and approachable fashion. It deals with the very important ideas in modern mathematical logic without the detailed mathematical work required of those with a professional interest in logic.The book begins with a historical survey of the development of mathematical logic from two parallel streams: formal deduction, which originated with Aristotle, Euclid, and others; and mathematical analysis, which dates back to Archimedes in the same era. The streams beg
Ferrite logic reliability study
Baer, J. A.; Clark, C. B.
1973-01-01
Development and use of digital circuits called all-magnetic logic are reported. In these circuits the magnetic elements and their windings comprise the active circuit devices in the logic portion of a system. The ferrite logic device belongs to the all-magnetic class of logic circuits. The FLO device is novel in that it makes use of a dual or bimaterial ferrite composition in one physical ceramic body. This bimaterial feature, coupled with its potential for relatively high speed operation, makes it attractive for high reliability applications. (Maximum speed of operation approximately 50 kHz.)
DEFF Research Database (Denmark)
Lopez, Hugo Andres; Carbone, Marco; Hildebrandt, Thomas
2010-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for speciﬁcation and veriﬁcation of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL...... ), a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service speciﬁcations. Finally, we show that, despite GL is undecidable, there is a signiﬁcant decidable fragment which we provide with a sound and complete proof...
Carbone, Marco; Hildebrandt, Thomas T; López, Hugo A; 10.4204/EPTCS.69.3
2011-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL), a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a significant decidable fragment which we provide with a sound and complete proof system for checking validity of formulae.
Directory of Open Access Journals (Sweden)
Marco Carbone
2011-10-01
Full Text Available We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL, a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a significant decidable fragment which we provide with a sound and complete proof system for checking validity of formulae.
Logic in the curricula of Computer Science
Directory of Open Access Journals (Sweden)
Margareth Quindeless
2014-12-01
Full Text Available The aim of the programs in Computer Science is to educate and train students to understand the problems and build systems that solve them. This process involves applying a special reasoning to model interactions, capabilities, and limitations of the components involved. A good curriculum must involve the use of tools to assist in these tasks, and one that could be considered as a fundamental is the logic, because with it students develop the necessary reasoning. Besides, software developers analyze the behavior of the program during the designed, the depuration, and testing; hardware designers perform minimization and equivalence verification of circuits; designers of operating systems validate routing protocols, programing, and synchronization; and formal logic underlying all these activities. Therefore, a strong background in applied logic would help students to develop or potentiate their ability to reason about complex systems. Unfortunately, few curricula formed and properly trained in logic. Most includes only one or two courses of Discrete Mathematics, which in a few weeks covered truth tables and the propositional calculus, and nothing more. This is not enough, and higher level courses in which they are applied and many other logical concepts are needed. In addition, students will not see the importance of logic in their careers and need to modify the curriculum committees or adapt the curriculum to reverse this situation.
Learning fuzzy logic control system
Lung, Leung Kam
1994-01-01
The performance of the Learning Fuzzy Logic Control System (LFLCS), developed in this thesis, has been evaluated. The Learning Fuzzy Logic Controller (LFLC) learns to control the motor by learning the set of teaching values that are generated by a classical PI controller. It is assumed that the classical PI controller is tuned to minimize the error of a position control system of the D.C. motor. The Learning Fuzzy Logic Controller developed in this thesis is a multi-input single-output network. Training of the Learning Fuzzy Logic Controller is implemented off-line. Upon completion of the training process (using Supervised Learning, and Unsupervised Learning), the LFLC replaces the classical PI controller. In this thesis, a closed loop position control system of a D.C. motor using the LFLC is implemented. The primary focus is on the learning capabilities of the Learning Fuzzy Logic Controller. The learning includes symbolic representation of the Input Linguistic Nodes set and Output Linguistic Notes set. In addition, we investigate the knowledge-based representation for the network. As part of the design process, we implement a digital computer simulation of the LFLCS. The computer simulation program is written in 'C' computer language, and it is implemented in DOS platform. The LFLCS, designed in this thesis, has been developed on a IBM compatible 486-DX2 66 computer. First, the performance of the Learning Fuzzy Logic Controller is evaluated by comparing the angular shaft position of the D.C. motor controlled by a conventional PI controller and that controlled by the LFLC. Second, the symbolic representation of the LFLC and the knowledge-based representation for the network are investigated by observing the parameters of the Fuzzy Logic membership functions and the links at each layer of the LFLC. While there are some limitations of application with this approach, the result of the simulation shows that the LFLC is able to control the angular shaft position of the
Understanding Social Media Logic
Directory of Open Access Journals (Sweden)
José van Dijck
2013-08-01
Full Text Available Over the past decade, social media platforms have penetrated deeply into the mechanics of everyday life, affecting people's informal interactions, as well as institutional structures and professional routines. Far from being neutral platforms for everyone, social media have changed the conditions and rules of social interaction. In this article, we examine the intricate dynamic between social media platforms, mass media, users, and social institutions by calling attention to social media logic—the norms, strategies, mechanisms, and economies—underpinning its dynamics. This logic will be considered in light of what has been identified as mass media logic, which has helped spread the media's powerful discourse outside its institutional boundaries. Theorizing social media logic, we identify four grounding principles—programmability, popularity, connectivity, and datafication—and argue that these principles become increasingly entangled with mass media logic. The logic of social media, rooted in these grounding principles and strategies, is gradually invading all areas of public life. Besides print news and broadcasting, it also affects law and order, social activism, politics, and so forth. Therefore, its sustaining logic and widespread dissemination deserve to be scrutinized in detail in order to better understand its impact in various domains. Concentrating on the tactics and strategies at work in social media logic, we reassess the constellation of power relationships in which social practices unfold, raising questions such as: How does social media logic modify or enhance existing mass media logic? And how is this new media logic exported beyond the boundaries of (social or mass media proper? The underlying principles, tactics, and strategies may be relatively simple to identify, but it is much harder to map the complex connections between platforms that distribute this logic: users that employ them, technologies that
Model Checking Is Static Analysis of Modal Logic
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
2010-01-01
Flow Logic is an approach to the static analysis of programs that has been developed for functional, imperative and object-oriented programming languages and for concurrent, distributed, mobile and cryptographic process calculi. In this paper we extend it; to deal with modal logics and prove...
Model Checking Is Static Analysis of Modal Logic
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
2010-01-01
Flow Logic is an approach to the static analysis of programs that has been developed for functional, imperative and object-oriented programming languages and for concurrent, distributed, mobile and cryptographic process calculi. In this paper we extend it; to deal with modal logics and prove...
Magnetic tunnel junction based spintronic logic devices
Lyle, Andrew Paul
Magnetic Quantum Cellular Automata (MQCA). MQCA has the potential to be thousands of times more energy efficient than CMOS technology. While interesting, these systems are academic unless they can be interfaced into current technologies. This dissertation pushed past a major hurdle by experimentally demonstrating a spintronic input/output (I/O) interface for the magnetostatically coupled nanomagnets by incorporating MTJs. This spintronic interface allows individual nanomagnets to be programmed using spin transfer torque and read using magneto resistance structure. Additionally the spintronic interface allows statistical data on the reliability of the magnetic coupling utilized for data propagation to be easily measured. The integration of spintronics and MQCA for an electrical interface to achieve a magnetic logic device with low power creates a competitive post-CMOS logic device. The final logic architecture that was studied used MTJs to compute logic functions and magnetic domain walls to communicate between gates. Simulations were used to optimize the design of this architecture. Spin transfer torque was used to compute logic function at each MTJ gate and was used to drive the domain walls. The design demonstrated that multiple nanochannels could be connected to each MTJ to realize fan-out from the logic gates. As a result this logic scheme eliminates the need for intermediate reads and conversions to pass information from one logic gate to another.
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates of the ...
Ponse, A.; Zwaag, M.B. van der
2002-01-01
We distinguish two interpretations for the truth value `undefined' in Kleene's three-valued logic. Combining these two interpretations leads to a four-valued propositional logic that characterizes two particular ingredients of process algebra: ``choice' and ``inaction'. We study two different bases
S.L. Uckelman
2009-01-01
The origins of treating agency as a modal concept go back at least to the 11th century when Anselm, Archbishop of Canterbury, provided a modal explication of the Latin facere ‘to do’, which can be formalized within the context of modern modal logic and neighborhood semantics. The agentive logic indu
Boyd, Robert
1995-01-01
This article proposes that within the discipline of logic, college students can learn the important elements of persuasive writing. Characteristics of and distinctions between deductive and inductive logic are outlined, and the appropriateness and usefulness of each for different kinds of persuasion are discussed. (MSE)
Inductive Logic and Statistics
Romeijn, J. -W.
2009-01-01
This chapter concerns inductive logic in relation to mathematical statistics. I start by introducing a general notion of probabilistic induc- tive inference. Then I introduce Carnapian inductive logic, and I show that it can be related to Bayesian statistical inference via de Finetti's representatio
Logic of Algorithmic Knowledge
Directory of Open Access Journals (Sweden)
Surowik Dariusz
2015-09-01
Full Text Available In this paper we consider the construction of a LAK system of temporal-epistemic logic which is used to formally describe algorithmic knowledge. We propose an axiom system of LAK and discuss the basic properties of this logic.
Programmable Logic Controllers.
Insolia, Gerard; Anderson, Kathleen
This document contains a 40-hour course in programmable logic controllers (PLC), developed for a business-industry technology resource center for firms in eastern Pennsylvania by Northampton Community College. The 10 units of the course cover the following: (1) introduction to programmable logic controllers; (2) DOS primer; (3) prerequisite…
Yopp, David
2010-01-01
Understanding logical necessity is an important component of proof and reasoning for teachers of grades K-8. The ability to determine exactly where young students' arguments are faulty offers teachers the chance to give youngsters feedback as they progress toward writing mathematically valid deductive proofs. As defined, logical necessity is the…
Directory of Open Access Journals (Sweden)
Evandro Agazzi
2011-06-01
Full Text Available Humans have used arguments for defending or refuting statements long before the creation of logic as a specialized discipline. This can be interpreted as the fact that an intuitive notion of "logical consequence" or a psychic disposition to articulate reasoning according to this pattern is present in common sense, and logic simply aims at describing and codifying the features of this spontaneous capacity of human reason. It is well known, however, that several arguments easily accepted by common sense are actually "logical fallacies", and this indicates that logic is not just a descriptive, but also a prescriptive or normative enterprise, in which the notion of logical consequence is defined in a precise way and then certain rules are established in order to maintain the discourse in keeping with this notion. Yet in the justification of the correctness and adequacy of these rules commonsense reasoning must necessarily be used, and in such a way its foundational role is recognized. Moreover, it remains also true that several branches and forms of logic have been elaborated precisely in order to reflect the structural features of correct argument used in different fields of human reasoning and yet insufficiently mirrored by the most familiar logical formalisms.
Blackburn, P.; Rijke, M. de
1995-01-01
Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailored made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standar
CSIR Research Space (South Africa)
Klarman, S
2013-05-01
Full Text Available We introduce Description Logics of Context (DLCs) - an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy's tradition of treating contexts as formal objects over which one can quantify...
Directory of Open Access Journals (Sweden)
Daniel Durante Pereira Alves
2011-04-01
Full Text Available Analyzing the position of two philosophers whose views are recognizably divergent, W. O. Quine and M. Dummett, we intend to support a striking point of agreement between them: the idea that our logical principles constitute our principles about what there is, and therefore, that logic is metaphysics.
Daniel Durante Pereira Alves
2011-01-01
Analyzing the position of two philosophers whose views are recognizably divergent, W. O. Quine and M. Dummett, we intend to support a striking point of agreement between them: the idea that our logical principles constitute our principles about what there is, and therefore, that logic is metaphysics.
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2012-01-01
In this paper we explore the logic of now, yesterday, today and tomorrow by combining the semantic approach to indexicality pioneered by Hans Kamp [9] and refined by David Kaplan [10] with hybrid tense logic. We first introduce a special now nominal (our @now corresponds to Kamp’s original now...
Microelectromechanical reprogrammable logic device
Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.
2016-03-01
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
Amplifying genetic logic gates.
Bonnet, Jerome; Yin, Peter; Ortiz, Monica E; Subsoontorn, Pakpoom; Endy, Drew
2013-05-03
Organisms must process information encoded via developmental and environmental signals to survive and reproduce. Researchers have also engineered synthetic genetic logic to realize simpler, independent control of biological processes. We developed a three-terminal device architecture, termed the transcriptor, that uses bacteriophage serine integrases to control the flow of RNA polymerase along DNA. Integrase-mediated inversion or deletion of DNA encoding transcription terminators or a promoter modulates transcription rates. We realized permanent amplifying AND, NAND, OR, XOR, NOR, and XNOR gates actuated across common control signal ranges and sequential logic supporting autonomous cell-cell communication of DNA encoding distinct logic-gate states. The single-layer digital logic architecture developed here enables engineering of amplifying logic gates to control transcription rates within and across diverse organisms.
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
The purpose of the article is to demonstrate that in order to understand competition as a socially organizing phenomenon, we should not examine competition in isolation, but as constellations of heterogeneous logics. More precisely, the article is based on two main theoretical points: (1) Logics...... of competition are only realized as particular forms of social organization by virtue of interplaying with other kinds of logics, like legal logics. (2) Competition logics enjoy a peculiar status in-between constructedness and givenness; although competition depends on laws and mechanisms of socialization, we...... still experience competition as an expression of spontaneous human activities. On the basis of these perspectives, a study of fundamental rights of EU law, springing from the principle of ‘free movement of people’, is conducted. The first part of the empirical analysis seeks to detect the presence...
Malhas, Othman Qasim
1993-10-01
The concept of “abacus logic” has recently been developed by the author (Malhas, n.d.). In this paper the relation of abacus logic to the concept of fuzziness is explored. It is shown that if a certain “regularity” condition is met, concepts from fuzzy set theory arise naturally within abacus logics. In particular it is shown that every abacus logic then has a “pre-Zadeh orthocomplementation”. It is also shown that it is then possible to associate a fuzzy set with every proposition of abacus logic and that the collection of all such sets satisfies natural conditions expected in systems of fuzzy logic. Finally, the relevance to quantum mechanics is discussed.
Microelectromechanical reprogrammable logic device
Hafiz, M. A. A.
2016-03-29
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
Mathematical logic for computer science
Zhong Wan Lu
1998-01-01
Mathematical logic is essentially related to computer science. This book describes the aspects of mathematical logic that are closely related to each other, including classical logic, constructive logic, and modal logic. This book is intended to attend to both the peculiarities of logical systems and the requirements of computer science.In this edition, the revisions essentially involve rewriting the proofs, increasing the explanations, and adopting new terms and notations.
Arthur Prior and medieval logic
2012-01-01
Though Arthur Prior is now best known for his founding of modern temporal logic and hybrid logic, much of his early philosophical career was devoted to history of logic and historical logic. This interest laid the foundations for both of his ground-breaking innovations in the 1950s and 1960s. Because of the important rôle played by Prior’s research in ancient and medieval logic in his development of temporal and hybrid logic, any student of Prior, temporal logic, or hybrid logic should be fam...
Bozzelli, Laura; French, Tim; Hales, James; Pinchinat, Sophie
2012-01-01
In this paper we present refinement modal logic. A refinement is like a bisimulation, except that from the three relational requirements only 'atoms' and 'back' need to be satisfied. Our logic contains a new operator 'forall' in additional to the standard modalities 'Box' for each agent. The operator 'forall' acts as a quantifier over the set of all refinements of a given model. We call it the refinement operator. As a variation on a bisimulation quantifier, it can be seen as a refinement quantifier over a variable not occurring in the formula bound by the operator. The logic combines the simplicity of multi-agent modal logic with some powers of monadic second order quantification. We present a sound and complete axiomatization of multiagent refinement modal logic. We also present an extension of the logic to the modal mu-calculus, and an axiomatization for the single-agent version of this logic. Examples and applications are also discussed: to software verification and design (the set of agents can also be s...
Metaphysics of Logical Realism
Directory of Open Access Journals (Sweden)
Mohammadreza Abdollahnejad
2015-08-01
Full Text Available Despite the often false impression that the analytic philosophy as an anti-metaphysical movement has nothing to do with metaphysics, there can be found good reasons to grant the metaphysical dispositions of analytic philosophers, and thereby, to minimize the anti-metaphysical nature of analytic philosophy in its all phases. Since analytic philosophy is a historical movement the main nature of which developed through several stages, the very kinds of metaphysical dispositions within each one of its various stages can be easily portrayed. In the meantime, logical realism as the early stage of analytic philosophy contains plenty of metaphysical dispositions. Undoubtedly, one cannot say that analytic philosophy in this period was not committed to metaphysical theses about the plurality of entities, the ultimate nature of reality and the logical structure of the world. In this paper, then, after giving a relatively complete explanation of the logical realism, we claimed that although logical realists rejected the traditional speculative metaphysics of their predecessors, they also replaced it by the metaphysics of logic that pursues the metaphysical aims, this time, by logical means. So, we portrayed this kind of metaphysics as Bolzano’s Semantic Platonism, Frege’s and Russell’s Pluralistic Platonism, Russell’s Pluralistic Atomism, and Wittgenstein’s logical atomism.
Directory of Open Access Journals (Sweden)
Ostapenko Y.O.
2014-03-01
Full Text Available Purpose: to improve vocational and applied physical training of students of economics. Material: the pedagogical study involved 72 male students (aged 19-20 years. Results: job study was conducted. Defined professionally significant neurobehavioral performance of students of information logical group. Matched professionally applied exercises for their development. The results showed that in the process of purposeful muscle activity improved mechanisms of regulation of neural processes, adaptive changes occur that affect the temporal parameters of sensorimotor motor responses. A comparative analysis of the psychophysiological indicators of students of the control and experimental groups was done. Conclusions: it was found that matched professionally applied exercises positively affect the development of psycho-physiological qualities of students information and logical group of specialties.
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...... of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method....
DEFF Research Database (Denmark)
Filipiuk, Piotr; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions...... are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping of analyses and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases...
Logic in elementary mathematics
Exner, Robert M
2011-01-01
This applications-related introductory treatment explores facets of modern symbolic logic useful in the exposition of elementary mathematics. The authors convey the material in a manner accessible to those trained in standard elementary mathematics but lacking any formal background in logic. Topics include the statement calculus, proof and demonstration, abstract mathematical systems, and the restricted predicate calculus. The final chapter draws upon the methods of logical reasoning covered in previous chapters to develop solutions of linear and quadratic equations, definitions of order and
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates...... characterizes stochastic bisimilarity and it supports the definition of a quantified extension of the satisfiability relation that measures the "compatibility" between a model and a property. In this context, the metaproperties allows us to prove two robustness theorems for the logic stating that one can...
Kramer, Simon
2012-01-01
We propose a logic of interactive proofs as the first and main step towards an intuitionistic foundation for interactive computation to be obtained via an interactive analog of the G\\"odel-Kolmogorov-Art\\"emov definition of intuitionistic logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs effectuate a persistent epistemic impact in their intended communities of peer reviewers that consists in the induction of the (propositional) knowledge of their proof goal by means of the (individual) knowledge of the proof with the interpreting reviewer. That is, interactive proofs effectuate a transfer of propositional knowledge---(to-be-)known facts---via the transfer of certain individual knowledge---(to-be-)known proofs---in distributed and multi-agent systems. In other words, we as a community can have the formal common knowledge that a proof is that which if known to one of our peer members would induce...
Propositional Dynamic Logic as a Logic of Belief Revision
D.J.N. van Eijck (Jan); Y. Wang (Yanjing)
2008-01-01
htmlabstractThis paper shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study of inform......Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...... of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method....
Directory of Open Access Journals (Sweden)
Schumann Andrew
2016-03-01
Full Text Available The paper considers main features of two groups of logics for biological devices, called Physarum Chips, based on the plasmodium. Let us recall that the plasmodium is a single cell with many diploid nuclei. It propagates networks by growing pseudopodia to connect scattered nutrients (pieces of food. As a result, we deal with a kind of computing. The first group of logics for Physarum Chips formalizes the plasmodium behaviour under conditions of nutrient-poor substrate. This group can be defined as standard storage modification machines. The second group of logics for Physarum Chips covers the plasmodium computing under conditions of nutrient-rich substrate. In this case the plasmodium behaves in a massively parallel manner and propagates in all possible directions. The logics of the second group are unconventional and deal with non-well-founded data such as infinite streams.
Dialectic operator fuzzy logic
Institute of Scientific and Technical Information of China (English)
程晓春; 姜云飞; 刘叙华
1996-01-01
Dialectic operator fuzzy logic (DOFL) is presented which is relevant,paraconsistent and nonmonotonic.DOFL can vividly describe the belief revision in the cognitive process and can infer reasonably well while the knowledge is inconsistent,imprecise or incomplete.
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
The purpose of the article is to demonstrate that in order to understand competition as a socially organizing phenomenon, we should not examine competition in isolation, but as constellations of heterogeneous logics. More precisely, the article is based on two main theoretical points: (1) Logics...... still experience competition as an expression of spontaneous human activities. On the basis of these perspectives, a study of fundamental rights of EU law, springing from the principle of ‘free movement of people’, is conducted. The first part of the empirical analysis seeks to detect the presence...... of a presumed logic of competition within EU law, whereas the second part focuses on particular legal logics. In this respect, the so-called ‘real link criterion’ (determining the access to transnational social rights for certain groups of unemployed people) is given special attention. What is particularly...
Geneves, Pierre
2008-01-01
This thesis describes the theoretical and practical foundations of a system for the static analysis of XML processing languages. The system relies on a fixpoint temporal logic with converse, derived from the mu-calculus, where models are finite trees. This calculus is expressive enough to capture regular tree types along with multi-directional navigation in trees, while having a single exponential time complexity. Specifically the decidability of the logic is proved in time 2^O(n) where n is the size of the input formula. Major XML concepts are linearly translated into the logic: XPath navigation and node selection semantics, and regular tree languages (which include DTDs and XML Schemas). Based on these embeddings, several problems of major importance in XML applications are reduced to satisfiability of the logic. These problems include XPath containment, emptiness, equivalence, overlap, coverage, in the presence or absence of regular tree type constraints, and the static type-checking of an annotated query....
Reasoning, logic, and psychology.
Stenning, Keith; van Lambalgen, Michiel
2011-09-01
We argue that reasoning has been conceptualized so narrowly in what is known as 'psychology of reasoning' that reasoning's relevance to cognitive science has become well-nigh invisible. Reasoning is identified with determining whether a conclusion follows validly from given premises, where 'valid' is taken to mean 'valid according to classical logic'. We show that there are other ways to conceptualize reasoning, more in line with current logical theorizing, which give it a role in psychological processes ranging from (verbal) discourse comprehension to (nonverbal) planning. En route we show that formal logic, at present marginalized in cognitive science, can be an extremely valuable modeling tool. In particular, there are cases in which probabilistic modeling must fail, whereas logical models do well. WIREs Cogni Sci 2011 2 555-567 DOI: 10.1002/wcs.134 For further resources related to this article, please visit the WIREs website.
Extending Value Logic Thinking to Value Logic Portfolios
DEFF Research Database (Denmark)
Ritter, Thomas; Andersen, Poul Houman
Based on value creation logic theory (Stabell & Fjeldstad, 1998), this paper suggests an extension of the original Stabell & Fjeldstad model by an additional fourth value logic, the value system logic. Furthermore, instead of only allowing one dominant value creation logic for a given firm...... or transaction, an understanding of firms and transactions as a portfolio of value logics (i.e. an interconnected coexistence of different value creation logics) is proposed. These additions to the original value creation logic theory imply interesting avenues for both, strategic decision making in firms...
Echoes in Plato's cave : ontology of sound objects in computer music and analysis
Marsden, Alan
2014-01-01
The sonic aspects of Plato's analogy of the cave is taken as a starting point for thought experiments to investigate the objective nature of sound, and the idea of quasi-Platonic forms in music. Sounds are found to be objects in a way that sights or appearances are not, and it is only in the presence of technology that they become artificial. When recognition, control and communication about sound come into play, abstract concepts emerge, but there is no reason to give these the priority stat...
Ontological Questions in Schelling’s Late Philosophy: Plato and Aristotle
Directory of Open Access Journals (Sweden)
Jean-François Courtine
2010-09-01
Full Text Available The purpose of the article is to understand the reasons and procedures employed by F. W. Schelling in his Plato and Aristotle re-appropriation, and to extract the authentically ontological thematic of it. It makes a path through the Schelling’s late writings and letters, to construct a complete view about the relation between this appropriation and the possibility of the constitution of a positive philosophy, as a particular science, in opposition to a negative philosophy, understood as metaphysics.
Numbers Rule The Vexing Mathematics of Democracy, from Plato to the Present
Szpiro, George G
2010-01-01
Since the very birth of democracy in ancient Greece, the simple act of voting has given rise to mathematical paradoxes that have puzzled some of the greatest philosophers, statesmen, and mathematicians. Numbers Rule traces the epic quest by these thinkers to create a more perfect democracy and adapt to the ever-changing demands that each new generation places on our democratic institutions. In a sweeping narrative that combines history, biography, and mathematics, George Szpiro details the fascinating lives and big ideas of great minds such as Plato, Pliny the Younger, Ramon Llull, Pierre Simo
Tan, Yong
2013-01-01
In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover shows a new method of cutting graph. Around this model, there are six algorithms in this paper including exact graph traversal, Algebra calculation of natural number, graph partition and graph coloring.
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
1999-01-01
Conceptual spaces have been proposed as topological or geometric means for establishing conceptual structures and models. This paper, after briey reviewing conceptual spaces, focusses on the relationship between conceptual spaces and logical concept languages with operations for combining concepts...... to form concepts. Speci cally is introduced an algebraic concept logic, for which conceptual spaces are installed as semantic domain as replacement for, or enrichment of, the traditional....
Logic and declarative language
Downward, M
2004-01-01
Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.
Institute of Scientific and Technical Information of China (English)
Simon Mumford takes a more 'logical' view of gramm
2010-01-01
@@ Many people enjoy puzzles and solving prob lems,and the use of an element of logic can make grammar exercises more interesting.Exercises such as putting words in order and clozes can be consid ered forms of puzzles,but there are many more op portunities to challenge more logically-minded stu dents.Here are some language puzzles for students and teachers alike.
Yanushkevich, Svetlana N
2008-01-01
Preface Design Process and Technology Theory of logic design Analysis and synthesis Implementation technologies Predictable technologies Contemporary CAD of logic networks Number Systems Positional numbers Counting in a positional number system Basic arithmetic operations in various number systems Binary arithmetic Radix-complement representations Techniques for conversion of numbers in various radices Overflow Residue arithmetic Other binary codes Redundancy and reliability Graphical Data Structures Graphs in discrete devices and systems design Basic definitions T
Towards a Formal Occurrence Logic based on Predicate Logic
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
2015-01-01
In this discussion we will concentrate on the main characteristics of an alternative kind of logic invented by Hans Götzsche: Occurrence Logic, which is not based on truth functionality. Our approach is based on temporal logic developed and elaborated by A. N. Prior. We will focus on characterising...... argumentation based on formal Occurrence Logic concerning events and occurrences, and illustrate the relations between Predicate Logic and Occurrence Logic. The relationships (and dependencies) is conducive to an approach that can analyse the occurrences of ”logical statements based on different logical...... principles” in different moments. We will also conclude that the elaborated Götzsche’s Occurrence Logic could be able to direct us to a truth-functional independent computer-based logic for analysing argumentation based on events and occurrences....
Two Core Systems of Dynamic Logic
Institute of Scientific and Technical Information of China (English)
ZHANG Xiao-jun; LI Ke-sheng; HAO Yi-jiang
2012-01-01
Dynamic Logic (DL) is a formal system for reasoning on the input/output behaviors of programs. Hoare Logic (HL) is the precursor of all dynamic logics known today. Two core systems of DL are Propositional Dynamic Logic (PDL) and Quantificational Dynamic Logic (QDL). PDL is an extension of propositional logic with programs and is the appropriate place to begin investigating DL. QDL can be viewed as the first-order version of PDL. Predicate Dynamic Logic (DPL) is a subsystem of QDL and can be regarded as the most basic of a hierarchy of formulas-as-programs languages. These systems constitute the main topic of this essay. The authors’ elaboration here is very brief and sketchy and with the aim of providing the readers with only the most essence of the topic on the basis of other researchers’ works. The last part is the important one in which the authors summarize the approaches of extending Dynamic Logic. The conclusions are as follows: variants of DL are obtained by reinterpreting some constructs as something else, and/or by adding rules or operators, and/or by restricting or extending or revising some constructs, and/or combining a kind of logic with another one, and/or using a comprehensive way which insights from other disciplines according to its application in various domains. In all these cases, the authors give examples to illustrate the conclusion. It is generally proposed that sometimes the introduction of a new operator or rule or construct, or the introduction of reinterpretation or restriction or extension or revision of some constructs will increase expressive power and sometimes not; sometimes it has effect on the complexity of deciding satisfiability and sometimes not. Finally, the authors sum up major aspects which we should consider during investigating a specific variant of DL. The researchers should focus on the well-formed expressions and on the validity of expressions about it with respect to standard, non-standard and syntactically
INTEGRATED PROGRAMMATIC ENVIRONMENT OF THE DEPARTMENTAL OF MATHEMATICAL LOGIC OF «MATLOG»
Directory of Open Access Journals (Sweden)
Yurii I. Sinko
2010-09-01
Full Text Available The article deals with the introduction of new information technologies into the process of mathematical logic learning at the Kherson State University. The basic components of program system of mathematical logic learning are considered.
The music of morality and logic
National Research Council Canada - National Science Library
Mesz, Bruno; Rodriguez Zivic, Pablo H; Cecchi, Guillermo A; Sigman, Mariano; Trevisan, Marcos A
2015-01-01
... (Nattiez and Abbate, 1990). The aim of this work is to statistically corroborate the intuitions of musical thinkers and practitioners starting at least with Plato, that music can express complex human concepts beyond merely "happy" and "sad...
Energy Technology Data Exchange (ETDEWEB)
Bulsara, Adi R., E-mail: bulsara@spawar.navy.mil [SPAWAR Systems Center Pacific, San Diego, CA 92152-5001 (United States); Dari, Anna, E-mail: adari@asu.edu [Ira A. Fulton School of Engineering, Arizona State University, Tempe, AZ 85287-9309 (United States); Ditto, William L., E-mail: william.ditto@asu.edu [Ira A. Fulton School of Engineering, Arizona State University, Tempe, AZ 85287-9309 (United States); Murali, K., E-mail: kmurali@annauniv.edu [Department of Physics, Anna University, Chennai 600 025 (India); Sinha, Sudeshna, E-mail: sudeshna@imsc.res.in [Institute of Mathematical Sciences, Taramani, Chennai 600 113 (India); Indian Institute of Science Education and Research, Mohali, Transit Campus: MGSIPAP Complex, Sector 26 Chandigarh (India)
2010-10-05
In a recent publication it was shown that, when one drives a two-state system with two square waves as input, the response of the system mirrors a logical output (NOR/OR). The probability of obtaining the correct logic response is controlled by the interplay between the noise-floor and the nonlinearity. As one increases the noise intensity, the probability of the output reflecting a NOR/OR operation increases to unity and then decreases. Varying the nonlinearity (or the thresholds) of the system allows one to morph the output into another logic operation (NAND/AND) whose probability displays analogous behavior. Thus, the outcome of the interplay of nonlinearity and noise is a flexible logic gate with enhanced performance. Here we review this concept of 'Logical Stochastic Resonance' (LSR) and provide details of an electronic circuit system demonstrating LSR. Our proof-of-principle experiment involves a particularly simple realization of a two-state system realized by two adjustable thresholds. We also review CMOS implementations of a simple LSR circuit, and the concatenation of these LSR modules to emulate combinational logic, such as data flip-flop and full adder operations.
Arthur Prior and medieval logic
Uckelman, S.L.
2012-01-01
Though Arthur Prior is now best known for his founding of modern temporal logic and hybrid logic, much of his early philosophical career was devoted to history of logic and historical logic. This interest laid the foundations for both of his ground-breaking innovations in the 1950s and 1960s. Becaus
Fuzzy logic and neural network technologies
Villarreal, James A.; Lea, Robert N.; Savely, Robert T.
1992-01-01
Applications of fuzzy logic technologies in NASA projects are reviewed to examine their advantages in the development of neural networks for aerospace and commercial expert systems and control. Examples of fuzzy-logic applications include a 6-DOF spacecraft controller, collision-avoidance systems, and reinforcement-learning techniques. The commercial applications examined include a fuzzy autofocusing system, an air conditioning system, and an automobile transmission application. The practical use of fuzzy logic is set in the theoretical context of artificial neural systems (ANSs) to give the background for an overview of ANS research programs at NASA. The research and application programs include the Network Execution and Training Simulator and faster training algorithms such as the Difference Optimized Training Scheme. The networks are well suited for pattern-recognition applications such as predicting sunspots, controlling posture maintenance, and conducting adaptive diagnoses.
Logical Varieties in Normative Reasoning
Burgin, Mark; Mestdagh, de Vey
2011-01-01
Although conventional logical systems based on logical calculi have been successfully used in mathematics and beyond, they have definite limitations that restrict their application in many cases. For instance, the principal condition for any logical calculus is its consistency. At the same time, knowledge about large object domains (in science or in practice) is essentially inconsistent. Logical prevarieties and varieties were introduced to eliminate these limitations in a logically correct way. In this paper, the Logic of Reasonable Inferences is described. This logic has been applied successfully to model legal reasoning with inconsistent knowledge. It is demonstrated that this logic is a logical variety and properties of logical varieties related to legal reasoning are developed.
Discourse Preferences in Dynamic Logic
Jaspars, J; Jaspars, Jan; Kameyama, Megumi
1997-01-01
In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with additional preferential operators in the underlying static logic, which enables us to define defeasible (pragmatic) entailments over a given piece of discourse. We will show how this setting can be used for a dynamic logical analysis of preferential resolutions of ambiguous pronouns in discourse.
Philosophy and Mathematics in the Teaching of Plato: the Development of Idea and Modernity
Directory of Open Access Journals (Sweden)
Mikhailova N. V.
2014-01-01
Full Text Available It is well known that the largest philosophers differently explain the origin of mathematics. This question was investigated in antiquity, a substantial and decisive role in this respect was played by the Platonic doctrine. Therefore, discussing this issue the problem of interaction of philosophy and mathematics in the teachings of Plato should be taken into consideration. Many mathematicians believe that abstract mathematical objects belong in a certain sense to the world of ideas and that consistency of objects and theories really describes mathematical reality, as Plato quite clearly expressed his views on math, according to which mathematical concepts objectively exist as distinct entities between the world of ideas and the world of material things. In the context of foundations of mathematics, so called “Gödel’s Platonism” is of particular interest. It is shown in the article how Platonic objectification of mathematical concepts contributes to the development of modern mathematics by revealing philosophical understanding of the nature of abstraction. To substantiate his point of view, the author draws the works of contemporary experts in the field of philosophy of mathematics.
The PLATO Simulator: Modelling of High-Precision High-Cadence Space-Based Imaging
Marcos-Arenal, P; De Ridder, J; Aerts, C; Huygen, R; Samadi, R; Green, J; Piotto, G; Salmon, S; Catala, C; Rauer, H
2014-01-01
Many aspects of the design trade-off of a space-based instrument and its performance can best be tackled through simulations of the expected observations. The complex interplay of various noise sources in the course of the observations make such simulations an indispensable part of the assessment and design study of any space-based mission. We present a formalism to model and simulate photometric time series of CCD images by including models of the CCD and its electronics, the telescope optics, the stellar field, the jitter movements of the spacecraft, and all important natural noise sources. This formalism has been implemented in a versatile end-to-end simulation software tool, called PLATO Simulator, specifically designed for the PLATO space mission to be operated from L2, but easily adaptable to similar types of missions. We provide a detailed description of several noise sources and discuss their properties, in connection with the optical design, the allowable level of jitter, the quantum efficiency of th...
FORMT: Form-based Mutation Testing of Logical Specifications
Faatz, Andreas
2010-01-01
The draft paper defines a system, which is capable of maintaining bases of test cases for logical specifications. The specifications, which are subject to this system are transformed from their original shape in first-order logic to form-based expressions as originally introduced in logics of George Spencer-Brown. The innovation comes from the operations the system provides when injecting faults - so-called mutations - to the specifications. The system presented here applies to logical specifications from areas as different as programming, ontologies or hardware specifications.
Non-logic devices in logic processes
Ma, Yanjun
2017-01-01
This book shows readers how to design semiconductor devices using the most common and lowest cost logic CMOS processes. Readers will benefit from the author’s extensive, industrial experience and the practical approach he describes for designing efficiently semiconductor devices that typically have to be implemented using specialized processes that are expensive, time-consuming, and low-yield. The author presents an integrated picture of semiconductor device physics and manufacturing techniques, as well as numerous practical examples of device designs that are tried and true.
Logic and truth: Some logics without theorems
Directory of Open Access Journals (Sweden)
Jayanta Sen
2008-08-01
Full Text Available Two types of logical consequence are compared: one, with respect to matrix and designated elements and the other with respect to ordering in a suitable algebraic structure. Particular emphasis is laid on algebraic structures in which there is no top-element relative to the ordering. The significance of this special condition is discussed. Sequent calculi for a number of such structures are developed. As a consequence it is re-established that the notion of truth as such, not to speak of tautologies, is inessential in order to define validity of an argument.
Machine structure oriented control code logic
Bergstra, J.A.; Middelburg, C.A.
2009-01-01
Control code is a concept that is closely related to a frequently occurring practitioner’s view on what is a program: code that is capable of controlling the behaviour of some machine. We present a logical approach to explain issues concerning control codes that are independent of the details of the
Preferences of Agents in Defeasible Logic
Dastani, M.; Governatori, G.; Rotolo, A.; Torre, L.W.N. van der
2005-01-01
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference procedures. We discuss patterns of agent types in this setting. Finally, we illustra
Prakash, Manu; Gershenfeld, Neil
2007-02-09
We demonstrate universal computation in an all-fluidic two-phase microfluidic system. Nonlinearity is introduced into an otherwise linear, reversible, low-Reynolds number flow via bubble-to-bubble hydrodynamic interactions. A bubble traveling in a channel represents a bit, providing us with the capability to simultaneously transport materials and perform logical control operations. We demonstrate bubble logic AND/OR/NOT gates, a toggle flip-flop, a ripple counter, timing restoration, a ring oscillator, and an electro-bubble modulator. These show the nonlinearity, gain, bistability, synchronization, cascadability, feedback, and programmability required for scalable universal computation. With increasing complexity in large-scale microfluidic processors, bubble logic provides an on-chip process control mechanism integrating chemistry and computation.
Carlsson, Christer; Fullér, Robert
2004-01-01
Fuzzy Logic in Management demonstrates that difficult problems and changes in the management environment can be more easily handled by bringing fuzzy logic into the practice of management. This explicit theme is developed through the book as follows: Chapter 1, "Management and Intelligent Support Technologies", is a short survey of management leadership and what can be gained from support technologies. Chapter 2, "Fuzzy Sets and Fuzzy Logic", provides a short introduction to fuzzy sets, fuzzy relations, the extension principle, fuzzy implications and linguistic variables. Chapter 3, "Group Decision Support Systems", deals with group decision making, and discusses methods for supporting the consensus reaching processes. Chapter 4, "Fuzzy Real Options for Strategic Planning", summarizes research where the fuzzy real options theory was implemented as a series of models. These models were thoroughly tested on a number of real life investments, and validated in 2001. Chapter 5, "Soft Computing Methods for Reducing...
Giordano, Paolo
2009-01-01
We introduce the ring of Fermat reals, an extension of the real field containing nilpotent infinitesimals. The construction takes inspiration from Smooth Infinitesimal Analysis (SIA), but provides a powerful theory of actual infinitesimals without any need of a background in mathematical logic. In particular, on the contrary with respect to SIA, which admits models only in intuitionistic logic, the theory of Fermat reals is consistent with classical logic. We face the problem to decide if the product of powers of nilpotent infinitesimals is zero or not, the identity principle for polynomials, the definition and properties of the total order relation. The construction is highly constructive, and every Fermat real admits a clear and order preserving geometrical representation. Using nilpotent infinitesimals, every smooth functions becomes a polynomial because in Taylor's formulas the rest is now zero. Finally, we present several applications to informal classical calculations used in Physics: now all these calc...
Rushton, Andrew
2011-01-01
Many engineers encountering VHDL (very high speed integrated circuits hardware description language) for the first time can feel overwhelmed by it. This book bridges the gap between the VHDL language and the hardware that results from logic synthesis with clear organisation, progressing from the basics of combinational logic, types, and operators; through special structures such as tristate buses, register banks and memories, to advanced themes such as developing your own packages, writing test benches and using the full range of synthesis types. This third edition has been substantially rewritten to include the new VHDL-2008 features that enable synthesis of fixed-point and floating-point hardware. Extensively updated throughout to reflect modern logic synthesis usage, it also contains a complete case study to demonstrate the updated features. Features to this edition include: * a common VHDL subset which will work across a range of different synthesis systems, targeting a very wide range of technologies...
Functions and generality of logic reflections on Dedekind's and Frege's logicisms
Benis-Sinaceur, Hourya; Sandu, Gabriel
2015-01-01
This book examines three connected aspects of Frege's logicism: the differences between Dedekind's and Frege's interpretation of the term 'logic' and related terms and reflects on Frege's notion of function, comparing its understanding and the role it played in Frege's and Lagrange's foundational programs. It concludes with an examination of the notion of arbitrary function, taking into account Frege's, Ramsey's and Russell's view on the subject. Composed of three chapters, this book sheds light on important aspects of Dedekind's and Frege's logicisms. The first chapter explains how, although he shares Frege's aim at substituting logical standards of rigor to intuitive imports from spatio-temporal experience into the deductive presentation of arithmetic, Dedekind had a different goal and used or invented different tools. The chapter highlights basic dissimilarities between Dedekind's and Frege's actual ways of doing and thinking. The second chapter reflects on Frege's notion of a function, in comparison with ...
Magrini, James Michael
2014-01-01
Incorporating Gadamer and other thinkers from the continental tradition, this essay is a close and detailed hermeneutic, phenomenological, and ontological study of the dialectic practice of Plato's Socrates--it radicalizes and refutes the Socrates-as-teacher model that educators from scholar academic ideology embrace.
Klecka, Joseph A.
This report describes various aspects of lesson production and use of the PLATO system at Chanute Air Force Base. The first chapter considers four major factors influencing lesson production: (1) implementation of the "lean approach," (2) the Instructional Systems Development (ISD) role in lesson production, (3) the transfer of…
A Plan for the Evaluation of a Project to Develop Basic Medical Sciences Lessons on PLATO IV.
Jones, Les A.; And Others
A project to introduce PLATO IV computer-assisted instruction (CAI) in medical sciences education for health professionals was implemented at the School of Basic Medical Sciences at the University of Illinois. This paper describes the plan for evaluation of the project. Using a student questionnaire and additional general questions, the…
Arsenty, Richard P.; Kieffer, George H.
This paper describes a study of the teaching effectiveness of computer-assisted instruction using the PLATO system at the University of Illinois in a first level biology course. College enrollment, class rank, final grade, and time study data of the control and experimental groups were obtained from master rosters. A questionnaire administered to…
Mintz, Avi I.
2016-01-01
Background/Context: In one of the classics of educational philosophy, a key issue is remains unsettled. In Plato's "Republic," Socrates makes a case for the importance of a comprehensive education. Socrates is unclear, however, about whether the producer class is eligible for this comprehensive education. Purpose/Objective: Previous…
Magrini, James Michael
2014-01-01
Incorporating Gadamer and other thinkers from the continental tradition, this essay is a close and detailed hermeneutic, phenomenological, and ontological study of the dialectic practice of Plato's Socrates--it radicalizes and refutes the Socrates-as-teacher model that educators from scholar academic ideology embrace.
Institute of Scientific and Technical Information of China (English)
王艳华
2011-01-01
Program Logic Technology and Application is the introductory course in software technology. In this course, we explain the logical structure of Java and object-oriented thinking through the four learning scenarios. And these 4 scenarios contain 13 sub-scenarios. Different scenarios, uses different teaching methods. And the most basic methods are multimedia-based teaching, task-driven, and integration of teaching and learning, etc.%《程序逻辑技术与应用》是软件技术专业的入门课程，在这门课程中，主要是通过四个学习情境来讲解Java中的逻辑结构与面向对象的思想，在这四个学习情境中，又包含13个子情境，对于不同的学习情境，采用的教学方法也各不相同，最基本的是多媒体教学，并兼有任务驱动、教学做一体化等方式来完成。
Introduction to mathematical logic
Mendelson, Elliott
2009-01-01
The Propositional CalculusPropositional Connectives. Truth TablesTautologies Adequate Sets of Connectives An Axiom System for the Propositional Calculus Independence. Many-Valued LogicsOther AxiomatizationsFirst-Order Logic and Model TheoryQuantifiersFirst-Order Languages and Their Interpretations. Satisfiability and Truth. ModelsFirst-Order TheoriesProperties of First-Order Theories Additional Metatheorems and Derived Rules Rule C Completeness Theorems First-Order Theories with EqualityDefinitions of New Function Letters and Individual Constants Prenex Normal Forms Isomorphism of Interpretati
Stoll, Robert R
1979-01-01
Set Theory and Logic is the result of a course of lectures for advanced undergraduates, developed at Oberlin College for the purpose of introducing students to the conceptual foundations of mathematics. Mathematics, specifically the real number system, is approached as a unity whose operations can be logically ordered through axioms. One of the most complex and essential of modern mathematical innovations, the theory of sets (crucial to quantum mechanics and other sciences), is introduced in a most careful concept manner, aiming for the maximum in clarity and stimulation for further study in
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artifacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D-algebra....
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artefacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D -algebra....
Reactive standard deontic logic
Gabbay, Dov M.; Straßer, Christian
2015-01-01
We introduce a reactive variant of SDL (standard deontic logic): SDLR1 (reactive standard deontic logic). Given a Kripkean view on the semantics of SDL in terms of directed graphs where arrows -> represent the accessibility relation between worlds, reactive models add two elements: arrows -> are labelled as 'active' or 'inactive', and double arrows a dagger connect arrows, e.g. (x(1) -> x(2)) a dagger (x(3) -> x(4)). The idea is that passing through x(1) -> x(2) activates a switch represented...
Rebuschi, Manuel
2009-01-01
One of the highlights of recent informal epistemology is its growing theoretical emphasis upon various notions of context. The present paper addresses the connections between knowledge and context within a formal approach. To this end, a "contextual epistemic logic", CEL, is proposed, which consists of an extension of standard S5 epistemic modal logic with appropriate reduction axioms to deal with an extra contextual operator. We describe the axiomatics and supply both a Kripkean and a dialogical semantics for CEL. An illustration of how it may fruitfully be applied to informal epistemological matters is provided.
Evens, Aden
2015-01-01
Building a foundational understanding of the digital, Logic of the Digital reveals a unique digital ontology. Beginning from formal and technical characteristics, especially the binary code at the core of all digital technologies, Aden Evens traces the pathways along which the digital domain of abstract logic encounters the material, human world. How does a code using only 0s and 1s give rise to the vast range of applications and information that constitutes a great and growing portion of our world? Evens' analysis shows how any encounter between the actual and the digital must cross an ontolo
Gibson, J
2013-01-01
Most branches of organizing utilize digital electronic systems. This book introduces the design of such systems using basic logic elements as the components. The material is presented in a straightforward manner suitable for students of electronic engineering and computer science. The book is also of use to engineers in related disciplines who require a clear introduction to logic circuits. This third edition has been revised to encompass the most recent advances in technology as well as the latest trends in components and notation. It includes a wide coverage of application specific integrate
Nonlinear dynamics based digital logic and circuits.
Kia, Behnam; Lindner, John F; Ditto, William L
2015-01-01
We discuss the role and importance of dynamics in the brain and biological neural networks and argue that dynamics is one of the main missing elements in conventional Boolean logic and circuits. We summarize a simple dynamics based computing method, and categorize different techniques that we have introduced to realize logic, functionality, and programmability. We discuss the role and importance of coupled dynamics in networks of biological excitable cells, and then review our simple coupled dynamics based method for computing. In this paper, for the first time, we show how dynamics can be used and programmed to implement computation in any given base, including but not limited to base two.
Barriers in Concurrent Separation Logic: Now With Tool Support!
Hobor, Aquinas
2012-01-01
We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two. Unlike locks and critical sections, Pthreads barriers enable simultaneous resource redistribution between multiple threads and are inherently stateful, leading to significant complications in the design of the logic and its soundness proof. We show how our logic can be applied to a specific example program in a modular way. Our proofs are machine-checked in Coq. We showcase a program verification toolset that automatically applies the logic rules and discharges the associated proof obligations.
Automatic Function Annotations for Hoare Logic
Directory of Open Access Journals (Sweden)
Daniel Matichuk
2012-11-01
Full Text Available In systems verification we are often concerned with multiple, inter-dependent properties that a program must satisfy. To prove that a program satisfies a given property, the correctness of intermediate states of the program must be characterized. However, this intermediate reasoning is not always phrased such that it can be easily re-used in the proofs of subsequent properties. We introduce a function annotation logic that extends Hoare logic in two important ways: (1 when proving that a function satisfies a Hoare triple, intermediate reasoning is automatically stored as function annotations, and (2 these function annotations can be exploited in future Hoare logic proofs. This reduces duplication of reasoning between the proofs of different properties, whilst serving as a drop-in replacement for traditional Hoare logic to avoid the costly process of proof refactoring. We explain how this was implemented in Isabelle/HOL and applied to an experimental branch of the seL4 microkernel to significantly reduce the size and complexity of existing proofs.
Mapping Modular SOS to Rewriting Logic
DEFF Research Database (Denmark)
Braga, Christiano de Oliveira; Haeusler, Erik Hermann; Meseguer, José;
Modular SOS (MSOS) is a framework created to improve the modularity of structural operational semantics specifications, a formalism frequently used in the fields of programming languages semantics and process algebras. With the objective of defining formal tools to support the execution and verif......-performance implementation of RWL. In this paper we characterize the mapping and the MSOS-SL Interpreter. The reader is assumed to have some basic knowledge of structural operational semantics and object-oriented concepts....... and verification of MSOS specifications, we have defined a mapping, named , from MSOS to rewriting logic (RWL), a logic which has been proposed as a logical and semantic framework. We have proven the correctness of and implemented it as a prototype, the MSOS-SL Interpreter, in the Maude system, a high...
Radiation tolerant combinational logic cell
Maki, Gary R. (Inventor); Gambles, Jody W. (Inventor); Whitaker, Sterling (Inventor)
2009-01-01
A system has a reduced sensitivity to Single Event Upset and/or Single Event Transient(s) compared to traditional logic devices. In a particular embodiment, the system includes an input, a logic block, a bias stage, a state machine, and an output. The logic block is coupled to the input. The logic block is for implementing a logic function, receiving a data set via the input, and generating a result f by applying the data set to the logic function. The bias stage is coupled to the logic block. The bias stage is for receiving the result from the logic block and presenting it to the state machine. The state machine is coupled to the bias stage. The state machine is for receiving, via the bias stage, the result generated by the logic block. The state machine is configured to retain a state value for the system. The state value is typically based on the result generated by the logic block. The output is coupled to the state machine. The output is for providing the value stored by the state machine. Some embodiments of the invention produce dual rail outputs Q and Q'. The logic block typically contains combinational logic and is similar, in size and transistor configuration, to a conventional CMOS combinational logic design. However, only a very small portion of the circuits of these embodiments, is sensitive to Single Event Upset and/or Single Event Transients.
Greek, Indian and Arabic logic
Gabbay, Dov M
2004-01-01
Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and Renaissance Logic and Logic: A History of its Central. In designing the Handbook of the History of Logic, the Editors have taken the view that the history of logic holds more than an antiquarian interest, and that a knowledge of logic's rich and sophisticated development is, in various respects, relevant to the research programmes of the present day. Ancient logic is no exception. The present volume attests to the distant origins of some of modern logic's most important features, such as can be found in the claim by the authors of t...
Mapping Individual Logical Processes
Smetana, Frederick O.
1975-01-01
A technique to measure and describe concisely a certain class of individual mental reasoning processes has been developed. The measurement is achieved by recording the complete dialog between a large, varied computerized information system with a broad range of logical operations and options and a human information seeker. (Author/RC)
Logicism, intuitionism, and formalism
Symons, John
2008-01-01
Aims to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. This work is suitable for researchers and graduate students of philosophy, logic, mathematics and theoretical computer science.
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Krötzsch, Markus; Horrocks, Ian
2012-01-01
This paper provides a self-contained first introduction to description logics (DLs). The main concepts and features are explained with examples before syntax and semantics of the DL SROIQ are defined in detail. Additional sections review light-weight DL languages, discuss the relationship to the Web Ontology Language OWL and give pointers to further reading.
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2014-01-01
We study the international standard XACML 3.0 for describing security access control policies in a compositional way. Our main contributions are (i) to derive a logic that precisely captures the intentions of the standard, (ii) to formally define a semantics for the XACML 3.0 component evaluation...
Nonmonotonic logics and algebras
Institute of Scientific and Technical Information of China (English)
CHAKRABORTY Mihir Kr; GHOSH Sujata
2008-01-01
Several nonmonotonie logic systems together with their algebraic semantics are discussed. NM-algebra is defined.An elegant construction of an NM-algebra starting from a Boolean algebra is described which gives rise to a few interesting algebraic issues.
DEFF Research Database (Denmark)
Jensen, Jonas Buhrkal; Birkedal, Lars
2012-01-01
, separation means physical separation. In this paper, we introduce \\emph{fictional separation logic}, which includes more general forms of fictional separating conjunctions P * Q, where "*" does not require physical separation, but may also be used in situations where the memory resources described by P and Q...
LOGICAL SEMANTICS OF MODULARIZATION
DELAVALETTE, GRR
1992-01-01
An algebra of theories, signatures, renamings and the operations import and export is investigated. A normal form theorem for terms of this algebra is proved. Another algebraic approach and the relation with a fragment of second order logic are also considered.
Logical analysis of biological systems
DEFF Research Database (Denmark)
Mardare, Radu Iulian
2005-01-01
R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005.......R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005....
Preferential reasoning for modal logics
CSIR Research Space (South Africa)
Britz, K
2011-11-01
Full Text Available Modal logic is the foundation for a versatile and well-established class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with non-monotonic reasoning capabilities such as preferential reasoning as developed...
Grzegorczyk, Dawid; Mulawka, Jan J.; Nieznański, Edward
In this article there are presented a few methods of proving that can be adopted for epistemic logic. Those methods are used for proving sample thesis in a certain considered epistemic logic also described briefly in this work.
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Hybrid logic is an extension of modal logic which allows us to refer explicitly to points of the model in the syntax of formulas. It is easy to justify interest in hybrid logic on applied grounds, with the usefulness of the additional expressive power. For example, when reasoning about time one...... often wants to build up a series of assertions about what happens at a particular instant, and standard modal formalisms do not allow this. What is less obvious is that the route hybrid logic takes to overcome this problem often actually improves the behaviour of the underlying modal formalism....... For example, it becomes far simpler to formulate proof-systems for hybrid logic, and completeness results can be proved of a generality that is simply not available in modal logic. That is, hybridization is a systematic way of remedying a number of known deficiencies of modal logic. First-order hybrid logic...
Wansing, Heinrich; Willkommen, Caroline; Recent Trends in Philosophical Logic
2014-01-01
This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism, and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University ...
The Theory of Argumentation within Language and its relation to Plato, Saussure and Benveniste
Directory of Open Access Journals (Sweden)
Cristiane Dall'Cortivo-Lebler
2014-12-01
Full Text Available The Theory of Argumentation within Language, developed by Oswald Ducrot, Jean-Claude Anscombre and Marion Carel, has experienced along its development different phases and forms, constantly seeking to align to what its main developer, Oswald Ducrot, called external hypotheses and internal hypotheses. This paper discusses the presence of Linguistic Theories and Philosophy in Ducrot’s work regarding concepts of Plato, Ferdinand de Saussure and Émile Benveniste, which constitute its external assumptions. The presence of these concepts culminated in the creation of different concepts that comprise the Linguistic Semantics, and gave it a specific point of view about language that emphasizes the internal relationships among language components and understands that speech is the result of a linguistic activity where an “I” speaks to a “you”.
Alternative communication network designs for an operational Plato 4 CAI system
Mobley, R. E., Jr.; Eastwood, L. F., Jr.
1975-01-01
The cost of alternative communications networks for the dissemination of PLATO IV computer-aided instruction (CAI) was studied. Four communication techniques are compared: leased telephone lines, satellite communication, UHF TV, and low-power microwave radio. For each network design, costs per student contact hour are computed. These costs are derived as functions of student population density, a parameter which can be calculated from census data for one potential market for CAI, the public primary and secondary schools. Calculating costs in this way allows one to determine which of the four communications alternatives can serve this market least expensively for any given area in the U.S. The analysis indicates that radio distribution techniques are cost optimum over a wide range of conditions.
Banishing the Poet: The Pedagogical Function of Mythology in the Dialogues of Plato
Directory of Open Access Journals (Sweden)
Javier Martínez
2013-06-01
Full Text Available This text attempts to develop a sound justification for Plato’s pedagogical use of myth in the dialogues. In particular, I seek to resolve a seeming contradiction: why Plato personally made use of myths in spite of his many statements that seem to contradict such a pedagogical approach, especially his edict that poets and myth-makers be banished from his republic for the danger their works pose to the attainment of true philosophical wisdom. An analysis of the centrality of myths to the dialogues is carried out, followed by a discussion of the place of muthos in its Ionian historical context. This establishes the basis for resolving the contradiction through the division of muthos into two distinct modes: the fantastic and the eikastic.