Logic algorithms

Xem 1-20 trên 172 kết quả Logic algorithms
  • Algorithm is used to define the notion of decidability. It is a set of rules that precisely defines a sequence of operations. This is essential for computers to process information. Computer programs contain algorithms that detail specific instructions a computer should perform to carry out a specified task. The traditional computer program performs specific instructions sequentially, and uses crisp values of information which do not support uncertainties.

    pdf294p bi_bi1 08-07-2012 53 18   Download

  • Despite the great technological advancement experienced in recent years, Programmable Logic Controllers (PLC) are still used in many applications from the real world and still play a central role in infrastructure of industrial automation. PLC operate in the factory-floor level and are responsible typically for implementing logical control, regulatory control strategies, such as PID and fuzzy-based algorithms, and safety logics. Usually PLC are interconnected with the supervision level through communication network, such as Ethernet networks, in order to work in an integrated form....

    pdf178p 123859674 30-06-2012 107 48   Download

  • For the past years, the advancement and innovation of various fields of technology converge that resulted in the formation of emerging technologies. A technical innovation which represents progressive developments within a field of competitive advantage is considered as an emerging technology. In general, emerging technologies denote significant technology developments that capture new territory for the betterment of humanity. To date, creating new technologies and innovative algorithms is the focus of research and development.

    pdf348p orchid_1 25-09-2012 54 29   Download

  • Logic for Computer Science" provides an introduction to mathematical logic, with emphasis on proof theory and procedures for constructing formal proofs of formulae algorithmically. It is designed primarily for students, computer scientists, and, more generally, for mathematically inclined readers interested in the formalization of proofs and the foundations of automatic theorem proving. Since the main emphasis of the text is on the study of proof systems and algorithmic methods for constructing proofs, it contains features rarely found in other texts on logic.

    pdf534p mymi0809 19-01-2013 32 7   Download

  • The first five chapters provided a survey of algorithms for logic simulation, fault simulation, and automatic test pattern generation. That was followed by a brief survey of tester architectures and strategies to maximize tester effectiveness while minimizing overall test cost. We now turn our attention to methods for combining the various algorithms and testers in ways that make it possible to achieve quality levels consistent with product requirements and design methodologies.

    pdf64p doroxon 18-08-2010 49 5   Download

  • Numerous ATPG algorithms and heuristics have been developed over the years to test digital logic circuits. Some of these methods can trace their origins back to the very beginnings of the digital logic era. Unfortunately, they have proven inadequate to the task.

    pdf62p doroxon 18-08-2010 39 5   Download

  • We provide a logical definition of Minimalist grammars, that are Stabler’s formalization of Chomsky’s minimalist program. Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-asdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of the logical form. ...

    pdf8p bunrieu_1 18-04-2013 25 5   Download

  • We consider the problem of learning context-dependent mappings from sentences to logical form. The training examples are sequences of sentences annotated with lambda-calculus meaning representations. We develop an algorithm that maintains explicit, lambda-calculus representations of salient discourse entities and uses a context-dependent analysis pipeline to recover logical forms. The method uses a hidden-variable variant of the perception algorithm to learn a linear model used to select the best analysis.

    pdf9p hongphan_1 14-04-2013 14 4   Download

  • Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects. Although computational algorithms for unification of feature structures have been worked out in experimental research, these algcwithms become quite complicated, and a more precise description of feature structures is desirable. We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them.

    pdf10p bungio_1 03-05-2013 17 2   Download

  • Distribution Management (DM), formerly known as Velocity Management (VM), is an Army initiative to dramatically improve the performance of key logistics processes: distribution, repair, stockage determination, and financial management. This monograph describes how the then Velocity Management initiative was used to develop and implement a new algorithm for computing inventories maintained by Army supply support activities (SSAs). The new algorithm is called dollar cost banding (DCB), and it departs in important ways from the methodology that the Army had been using.

    pdf0p xuan2013 29-01-2013 27 1   Download

  • The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present an expressive entity-mention model that performs coreference resolution at an entity level. The model adopts the Inductive Logic Programming (ILP) algorithm, which provides a relational way to organize different knowledge of entities and mentions.

    pdf9p hongphan_1 15-04-2013 15 1   Download

  • In the general framework of a constraint-based grammar formalism often some sort of feature logic serves as the constraint language to describe linguistic objects. We investigate the extension of basic feature logic with subsumption (or matching) constraints, based on a weak notion of subsumption. This mechanism of oneway information flow is generally deemed to be necessary to give linguistically satisfactory descriptions of coordination phenomena in such formalisms.

    pdf8p bunmoc_1 20-04-2013 11 1   Download

  • We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semantically nonmonotonic grammars, yet unlike topdown methods, it also permits left-recursion. The enabling design feature of the algorithm is its implicit traversal of the analysis tree for the string being generated in a semantic-head-driven fashion. ...

    pdf11p bungio_1 03-05-2013 17 1   Download

  • We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation process: a parser and a generator for this language. The centerpiece of the system is the inversion algorithm designed to compute the generator code from the parser's PROLOG code, using the collection of minimal sets of essential arguments (MSEA) for predicates.

    pdf8p bungio_1 03-05-2013 29 1   Download

  • This paper describes a classical logic for attribute-value (or feature description) languages which ate used in urfification grammar to describe a certain kind of linguistic object commonly called attribute-value structure (or feature structure). Tile algorithm which is used for deciding satisfiability of a feature description is based on a restricted deductive closure construction for sets of literals (atomic formulas and negated atomic formulas). In contrast to the Kasper/Rounds approach (cf.

    pdf6p buncha_1 08-05-2013 17 1   Download

  • This paper describes an algorithm for generating quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given :default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input and output formats are described through a few access and construction functions. Thus, the algorithm is interesting for a modular linguistic theory, which is flexible with respect to syntactic and semantic framework. ...

    pdf6p buncha_1 08-05-2013 11 1   Download

  • The goal of this project is to continue the work of a student who worked on a pipelined VHDL implementation of the DES algorithm. Two architectures are studied for this project: one which is the fastest possible and another one which results in the less area than the first architecture on the FPGA. The meaning of speed for this project is the throughput (number of bits processed per second) and the meaning of area is number of CLB’s.

    pdf78p dunglh2013 02-04-2014 26 1   Download

  • Abstract Elliptic curve cryptosystems offer security comparable to that of traditional asymmetric cryptosystems, such as those based on the RSA encryption and digital signature algorithms, with smaller keys and computationally more efficient algorithms.

    pdf327p dunglh2013 02-04-2014 16 1   Download

  • Programmable Logic Controller. PRead this manual carefully before installing, wiring, operating, servicing or inspecting this equipment. e Keep this manual within easy reach for quick reference.The different programming languages ​​support different styles of programming (called programming methods). Part of the programming task is the selection of one of the most suitable language to solve problems. The different programming languages ​​require the programmer to handle the details at different levels of installed algorithms.

    doc443p duong_1986 02-06-2010 232 44   Download

  • Evolution of global technologies has prompted increasing complexity of applications developed in both, the industry and the scientific research fields. These complexities are generally attributed to nonlinearities, poorly defined dynamics and absence of apriori information about the systems. Imprecision, uncertainties and vagueness in information about the system are also playing vital roles in enhancing the complexity of application.

    pdf518p wqwqwqwqwq 06-07-2012 103 42   Download

CHỦ ĐỀ BẠN MUỐN TÌM

Đồng bộ tài khoản