1.

Laboratory for the Introductory Digital Course
- Otto Fucik; Penn State; Bodgan Wilamowski
This lab entails practical studying and designing of simple logic gates, combinational logic circuits (adders, multiplexers, decoders, etc.), memory elements (flip-flops), and sequential logic circuits (state machines). The student will design, build, and use his/her own logic circuits. Logic designs will be done using computer-aided design (CAD) tools and implemented using complex programmable logic devices (CPLD). In this laboratory, digital logic circuits will be designed and implemented using the Foundation Series Software and the XC95108PC84 CPLD from Xilinx, Inc. In the later part of the course, students are introduced to VHDL hardware descriptive language.

2.

$rec.titulo
- Wang Xuefang; Liu Peishun
Ultraproduct of first-order lattice-valued logic LF(X) based on finite lattice implication algebra

3.

Logical Expressiveness of Semantic Web Languages for Bibliographic Modeling
- Karen M. Wickett
The architects of the CIMR framework suggest using the Web Ontology Language (OWL) to encode categories and inference rules. Its high expressivity and known problems with decidability may give the impression that the most expressive level of OWL, OWL Full, can represent anything that can be said with first order logic, However, this is not the case. Even OWL Full cannot straightfowardly represent an axiom such as if a collection has some value z for Owner, then each item in the collection has the value z for Owner. OWL supports some inferences such as those based on a taxonomic hierarchy...

4.

Using GIPO to support learning in knowledge acquisition and automated planning
- T. L. Mccluskey; R. M. Simpson
The process of how knowledge is acquired and formulated in knowledge-intensive AI is difficult for a student to grasp without practical experience. Often, AI text books and lecture notes contain examples of logic formula or structured knowledge represen-tations which are well refined and bug free. These polished examples are then used to show reasoning mechanisms or the execu-tion of AI search methods. The process of how the knowledge representations them-selves are acquired and validated is often neglected. In this paper we describe the use of a tool called GIPO for teaching AI students. GIPO helps students understand and integrate aspects...

5.

1Instituto de Informática – Universidade Federal do Rio Grande do Sul (UFRGS)
- De Negócio; Lucinéia Heloisa Thom; Cirano Iochpe; Carolina Chiao; Caixa Postal; Porto Alegre; Rs Brasil
Abstract. For its reuse advantages, workflow patterns are increasingly attracting the interest of both researchers and vendors. However, patterns based on recurrent functions frequently found in business processes have not been extensively explored. This paper presents and classifies a set of workflow patterns where each pattern represents a recurrent business function. The mining of 190 workflow processes of more than 10 different organizations has evidenced the existence of most of the workflow patterns with high support in the workflow processes analyzed. Moreover, it became clear through this study that the set of patterns is both necessary and enough to design...

6.

A Graphical User Interface for Maude-NPA
- Departamento De; De Valencia; Author(s) S. Santiago; C. Talcott; S. Escobar; C. Meadows; J. Meseguer; Vo Bo; S. Santiago; C. Talcott; S. Escobar; C. Meadows; J. Meseguer
Abstract. This paper presents a graphical user interface (GUI) for the Maude-NPA, a crypto protocol analysis tool that takes into account al-gebraic properties of cryptosystems not supported by other tools, such as cancellation of encryption and decryption, Abelian groups (including exclusive-or), and modular exponentiation. Maude-NPA has a theoretical basis in rewriting logic, unification and narrowing, and performs back-wards search from a final attack state to determine whether or not it is reachable from an initial state. The GUI animates the Maude-NPA verifi-cation process, displaying the complete search tree and allowing users to display graphical representations of final and intermediate nodes...

7.

Beyond pure axioms: node creating rules in hybrid tableaux
- Patrick Blackburn; Equipe Langue Et Dialogue; Inria Lorraine; Balder Ten Cate
We present a method of extending the tableau calculus for the basic hybrid lan-guage which automatically yields completeness results for many frame classes that cannot be defined by means of pure axioms (for example, Church-Rosser frames). The extended calculus makes use of node-creating rules. These rules trade on the idea of using nominals to perform skolemization on formulas of the strong hybrid language. Alternatively, viewing them from a Hilbert-style perspective, such rules can be viewed as a systematic generalization of Gabbay’s irreflexivity rule. Our completeness result covers all frame classes definable by pure nominal-free univer-sal existential sentences of the strong...

8.

On expansions of WNM t-norm based logics with truth-constants∗
- Francesc Esteva; Carles Noguera
This paper focuses on completeness results about generic expansions of propositional Weak Nilpotent Minimum (WNM) logics with truth-constants. Indeed, we consider algebraic semantics for expansions of these logics with a set of truth-constants {r | r ∈ C}, for a suitable countable C ⊆ [0, 1], and provide a full description of completeness results when (i) the t-norm is a Weak Nilpotent Minimum satisfying the finite partition property and (ii) the set of truth-constants covers all the unit interval in the sense that each interval of the partition contains values of C in its interior.

9.

THE USE OF FUZZY LOGIC THEORY FOR SELECTING APPROPRIATE TOOL STEELS WITH PRICE ANALYSIS*
- N. Towhidi; R. Tavakkoli-moghaddam; S. E. Vahdat
Abstract- Selection of tool steels is not limited to one type of steel for satisfying customer needs. On the other hand, technical specifications of tool steels are not absolute and it consistently deviates from the mean. Thus in this paper, the fuzzy logic theory has been used for selecting appropriate tool steels with price analysis. The main steps are as follows: 1. Defining and obtaining four technical features and prices of tool steels manufactured in Iran. 2. Calculating the mean and standard deviation of some technical features. 3. Defining and establishing relevant membership functions. 4. Relating tool steels to the...

10.

Querying linguistic treebanks with monadic second-order logic in linear time
- Hendrik Maryns; Stephan Kepser
MonaSearch is a new powerful query tool for linguistic treebanks. The query language of MonaSearch is monadic second-order logic, an extension of first-order logic capable of expressing probably all linguis-tically interesting queries. In order to process queries efficiently, they are compiled into tree automata. A treebank is queried by checking whether the automaton representing the query accepts the tree, for each tree. Experiments show that even complex queries can be exe-cuted very efficiently. The tree automaton toolkit MONA is used for the computation of the automata. 1

11.

Full CMOS Single Supply PLC SoC ASIC with Integrated Analog Front-End
- Chul Nam; Young-gun Pu; Sang-woo Kim; Kang-yoon Lee
Abstract—This paper presents a single supply PLC SoC ASIC with a built-in analog Front-end circuit. To achieve the low power consumption along with low cost, this PLC SoC employs fully CMOS Analog Front End (AFE) and several LDO regulators (LDOs) to provide the internal power for Logic Core, DAC and Input/output Pad driver. The receiver part of the AFE consists of Pre-amplifier, Gain Amplifier

12.

AliQAn, Spanish QA System at multilingual
- M. Puchol-blasco; J. M. Gómez; S. Roger; K. Vila; J. Peral
In QA@CLEF 2008, we participate in monolingual (Spanish) and multilingual (English- Spanish) tasks. Specifically, in this paper, we will tackle with the English- Spanish QA task. In this edition we will deal with two main problems: an heterogeneous document collection (news articles and Wikipedia) and a large number of topic-related questions, which make somewhat difficult our participation. We want to highlight in the translation module in our system two possible mechanisms: one based on logic forms, and the other, on machine translation techniques. In addition, it has also been used a system of anaphora resolution that it is described below...

13.

Guizhou Academy of Sciences
- Yin Chen; Guangzhou P. R. China; Fangzhen Lin; Yisong Wang; Mingyi Zhang
In this paper we extend Lin and Zhao’s notions of loops and loop formulas to normal logic programs that may contain variables. Under our definition, a loop formula of such a logic program is a first-order sentence. We show that together with Clark’s completion, our notion of first-order loop for-mulas captures the answer set semantics on the instantiation-basis: for any finite set F of ground facts about the exten-sional relations of a program P, the answer sets of the ground program obtained by instantiating P using F are exactly the models of the propositional theory obtained by instantiating using F...

14.

Empirical Justifications for the Universalness of the Mental Logic and Mental Models Paradigm
- Yingrui Yang; Yi Zhao; Jianmin Zeng; Jiahong Guo; Shier Ju; Selmer Bringsjord
Though there is a long-standing controversy between mental logic theory and mental model theory in human deductive reasoning, the two theories do share one general hypothesis: that whether people reason by applying inference schemas or by constructing mental models, these mental representations and mechanisms should be universal across homo sapiens, which implies that they should be available to speakers of different languages. We examined this hypothesis by conducting a series of experiments in Chinese, parallel to the empirical research supporting mental logic (Yang, Braine, and O’Brien, 1998), and to that supporting mental models (Yang and Johnson-Laird, 2000). The results show...

15.

On regular temporal logics with past
- Christian Dax; Felix Klaedtke; Martin Lange
Abstract. The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL and the closely related SystemVerilog Assertions, SVA for short, are increasingly used in many phases of the hardware design cycle, from specification to verification. In this paper, we extend the common core of these specification languages with past operators. We name this extension RTL. Although all ω-regular properties are expressible in PSL, SVA, and RTL, past operators often allow one to specify properties more naturally and concisely. In fact, we show that RTL is exponentially more succinct...

16.

A Railway Signal Control System by Optical LAN and Design Simplification
- Masayuki Matsumoto
Abstract — When replace railway interlocking devices, setting up of large number of signal cables and confirming of wiring connections are required. So, it is worried that serious transport disorder caused by human error in wiring works would occur. We have developed a railway signal control system utilized optical LAN to reduce the signal cables and wiring works. Moreover, all signal devices operate independently, designers have to handle all devices one by one and pay great attention to avoid causing harmful influence each other. We propose the data-driven method to make easy to replace interlocking device. This logic is rearranged...

17.

Doing ‘health ’ research in an unhealthy research environment *
- S. Ryan Johansson
If research produces knowledge about health, and knowledge is essential for improving health, then health research improves health, particularly through policy. Health transition research is exceptionally important to the production of useful knowledge (Caldwell 1990:xiii) because it deals with the causes of improved health over time. While the logic is sound health research is not. It is a contentious field currently producing more confusion than enlightenment, in which continuing uncertainty means that it is difficult to identify and apply genuinely useful knowledge. Health research, including health transition research, is distributed over a number of fields which in themselves comprise separate...

18.

Intuitionistic quantum logic of an n-level system
- Sman Bas Spitters
A decade ago, Isham and Butterfield proposed a topos-theoretic approach to quan-tum mechanics, which meanwhile has been extended by Döring and Isham so as to provide a new mathematical foundation for all of physics. Last year, three of the present authors redeveloped and refined these ideas by combining the C*-algebraic approach to quantum theory with the so-called internal language of topos theory (see arXiv:0709.4364). The goal of the present paper is to illustrate our abstract setup through the concrete example of the C*-algebra Mn(C) of complex n × n matrices. This leads to an explicit expression for the pointfree quantum...

19.

Application of Fuzzy Logic to Control the DC-DC Converter
- M. Bayati Poodeh; S. Eshtehardiha; M. R. Zare
Abstract:- In this paper controlled DC-DC converter using several fuzzy logic control law algorithms are studied. These controllers are designed to eliminate the overshoot and reduce the settling time response. In order to improve this property several control algorithms were investigated. The first one was the state controller with decomposed fuzzy PI controller and the second one was fuzzy PD state space controller and the other one was fuzzy PID state space controller. All the analysis and simulations to duplicate on the above converter by MATLAB software were performed. The results confirm the capability of the control methods in the...

20.

Received
- Igor Aizenberg; Claudio Moraga
Abstract. It is shown in this paper that a model of multiple-valued logic over the field of complex numbers is the most appropriate for the representation of the genetic code as a multiple-valued function. The genetic code is considered as a partially defined multiple-valued function of three variables. The genetic code is the four-letter nucleic acid code, and it is translated into a 20-letter amino acid code from proteins (each of 20 amino acids is coded by the triplet of four nucleic acids). Thus, it is possible to consider the genetic code as a partially defined multiple-valued function of a...