Refine Results
Sort By
From
To
Page 2
Page 2
An introduction to description logics
Designed so that domain knowledge can be described and so that computers can reason about this knowledge. DLs have recently gained increased importance since they form the logical basis of widely used ontology languages, in particular the web ontology language OWL. Written by four renowned experts, this is the first textbook on description logics. It is suitable for self-study by graduates and as the basis for a university course. Starting from a basic DL, the book introduces the reader to their syntax, semantics, reasoning problems and model theory and discusses the computational complexity of these reasoning problems and algorithms to solve them.
Advances in proof-theoretic semantics
This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory.
Active Conceptual Modeling of Learning : Next Generation Learning-Base System Development
This volume contains a collection of the papers presented during the 1st International ACM-L Workshop, which was held on November 8, 2006 during the 25th International Conference on Conceptual Modeling, ER 2006, held November 6–9,2006, in Tucson, Arizona, plus several invited papers.These papers plus the invited papers represent the current thinking in conceptual modeling research, The active model can only be realized through technology integration (e.g., AI, software engineering, information technology,cognitive science, art and sciences, philosophy, etc.)
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
A Modular Calculus for the Average Cost of Data Structuring
This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.
A High-Performance Logical Framework -- All About Maude : How to Specify, Program, and Verify Systems in Rewriting Logic
This book gives a comprehensive account of Maude, a language and system based on rewriting logic. Many examples are used throughout the book to illustrate the main ideas and features of Maude, and its many possible uses. Maude modules are rewrite theories. Computation with such modules is - cient deduction by rewriting. Because of its logical basis and its initial model semantics,aMaude module defines a precise mathematical model.This means that Maude and its formal tool environment can be used in three, mutually reinforcing ways: • as a declarative programming language; • as an executable formal specification language; and • as a formal verification system. Maude’s rewriting logic is simple, yet very expressive. This gives Maude good representational capabilities as a semantic framework to formally represent a wide range of systems, including models of concurrency, distributed al- rithms, network protocols, semantics of programming languages, and models of cell biology. Rewriting logic is also an expressive universal logic,making Maude a fiexible logical framework in which many difierent logics and - ference systems can be represented and mechanized. This makes Maude a useful metatool to build many other tools, including those in its own formal tool environment. Thanks to the logic’s simplicity and the use of advanced semi-compilation techniques, Maude has a high-performance implementation, making it competitive with other declarative programming languages.
A Concise Introduction to Languages and Machines
This easy-to-follow text provides an accessible introduction to the key topics of formal languages and abstract machines within Computer Science.
A Computational Model of Natural Language Communication : Interpretation, Inference, and Production in Database Semantics
Part I of this book presents a high-level description of an artificial agent which humans can freely communicate with in their accustomed language. Part II analyzes the major constructions of natural language, i.e., intra- and extrapropositional functor - argument structure, coordination, and coreference, in the speaker and the hearer mode. Part III defines declarative specifications for fragments of English, which are used for an implementation in Java.
Language, Meaning, Interpretation
Philosophy of logic and language, and of meaning and communication are central to this volume. The discussion of these issues involves analytical approaches, including semantics and semiotics, philosophy of science, mathematical logic, phenomenology, hermeneutics and some aspects of philosophical anthropology and aesthetics. Philosophy of the Absolute also belongs to this broad repertoire of philosophical problems and disciplines. A number of problems and viewpoints derive from the metaphysical system; any relativistic view on ethical values, for instance, makes sense in relation to some absolute. Metaphysical system building may have come to an end, but after all it belongs to philosophy to remind us of our past.
Compositionality and Concepts in Linguistics and Psychology
By highlighting relations between experimental and theoretical work, this volume explores new ways of addressing one of the central challenges in the study of language and cognition. The articles bring together work by leading scholars and younger researchers in psychology, linguistics and philosophy. An introductory chapter lays out the background on concept composition, a problem that is stimulating much new research in cognitive science. Researchers in this interdisciplinary domain aim to explain how meanings of complex expressions are derived from simple lexical concepts and to show how these meanings connect to concept representations.
Completeness theory for propositional logics
Completeness is one of the most important notions in logic and the foundations of mathematics. Many variants of the notion have been de?ned in literature. We shallconcentrateonthesevariants,andaspects,of completenesswhicharede?ned in propositional logic. Completeness means the possibility of getting all correct and reliable sc- mata of inference by use of logical methods. The word ‘all’, seemingly neutral, is here a crucial point of distinction. Assuming the de?nition as given by E. Post we get, say, a global notion of completeness in which the reliability refers only to syntactic means of logic and outside the correct schemata of inference there are only inconsistent ones. It is impossible, however, to leave aside local aspects of the notion when we want to make it relative to some given or invented notion of truth. Completeness understood in this sense is the adequacy of logic in relation to some semantics, and the change of the logic is accompanied by the change of its semantics.
Compiling ESTEREL
Esterel is based on the simple idea of providing a software language that has a synchronous model of time. That is, the execution of the program is divided into discrete instants, and statements are either guaranteed to execute in a single instant, or take multiple instants as requested by the programmer. Suitable for programming safety-critical real-time systems, Esterel and its model of computation have found use in industrial applications such as avionics, integrated circuit design, and other safety-critical environments. While Compiling Esterel does not assume prior knowledge of the Esterel language, readers will appreciate having prior knowledge of programming language semantics and compiler technology, along with some familiarity with synchronous digital hardware design.
Causation, Coherence and Concepts : A Collection of Essays
the papers cover epistemology, general philosophy of science, philosophy of language, and philosophy of mind. The section titles Belief, Causation, Laws, Coherence, and Concepts and the paper titles give a more adequate impression of the topics dealt with.
Attitudes and changing contexts
In this book, the author defends a unified externalists account of propositional attitudes and reference, and formalizes this view within possible world semantics.
Aspectual Inquiries
The papers in this volume represent the results of a workshop on the syntax, semantics and acquisition of aspect held in 2002 whose purpose was to foment active cross-disciplinary communication. A number of the papers examine the syntactic representation of lexical or situation aspect, while others focus on the syntactic interaction of lexical aspect with grammatical aspect, and of grammatical aspect and tense. Other papers examine the role of aspect in discourse representations, while a third group of papers reports on results of empirical studies on the acquisition of aspect in both first and second language acquisition, and patterns of loss of morphosyntactic reflexes of aspect in language attrition.
Aspects of Automatic Text Analysis
This book It collects contributions of authors from a multidisciplinary area who focus on the topic of automatic text analysis from several (i.e. linguistic, mathematical, and information theoretical) perspectives. It describes methodological as well as methodical foundations and collects approaches in the field of text and corpus linguistics. In this sense, it contributes to the computational linguistic and information theoretical grounding of automatic text analysis.
Anaphora and Type Logical Grammar
This book develops a hybrid architecture that allows to incorporate anaphora resolution into grammatical deduction while avoiding these consequences. To this end, the grammar logic is enriched with a connective that specifically deals with anaphora.After giving a self-contained introduction into Type Logical Grammar in general, the book discusses the formal properties of this connective. In the sequel, Jäger applies this machinery to numerous linguistic phenomena pertaining to the interaction of pronominal anaphora, VP ellipsis and quantification. In the final chapter, the framework is extended to indefiniteness, specificity and sluicing.
Advances in verification of time Petri Nets and timed automata : A temporal logic approach
This monograph presents a comprehensive introduction to timed automata (TA) and time Petri nets (TPNs) which belong to the most widely used models of real-time systems. Some of the existing methods of translating time Petri nets to timed automata are presented, with a focus on the translations that correspond to the semantics of time Petri nets, associating clocks with various components of the nets. "Advances in Verification of Time Petri Nets and Timed Automata – A Temporal Logic Approach" introduces timed and untimed temporal specification languages and gives model abstraction methods based on state class approaches for TPNs and on partition refinement for TA. Moreover, the monograph presents a recent progress in the development of two model checking methods, based on either exploiting abstract state spaces or on application of SAT-based symbolic techniques.
A Practical Introduction to PSL
Practical Introduction to PSL is primarily targeted to hardware designers and verification engineers who plan to use PSL. This book is also of interest to students of temporal logic. The formal semantics of PSL are included as an appendix, and bibliographical notes include pointers to some of the main theoretical works.
