Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 67 for “"First-order logic"”.
-
Formulas of first-order logic in distributive normal form
… by Jaakko Hintikka that every formula of first-order logic can be written as a disjunction of formulas called constituents. Such a disjunction is called a distributive normal form of the formula. It is a generalization of the disjunctive normal form for propositional logic. However, there are …
-
First order logic as a formal language : an investigation of categorial grammar.
Thesis. 1976. Ph.D.--Massachusetts Institute of Technology. Dept. of Philosophy.
-
Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-Up Learning, and to Deduction
… any two or more syntactic objects in a partially-ordered set of such objects. The dual of unification is an operation called generalization, or anti-unification, which computes least or minimal upper bounds. As with unification, anti-unification comes in a variety of forms. The thesis of this …
-
Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic (Clause Form, Discrimination Networks, Heuristic Search, Locking Resolution)
This thesis describes a resolution based theorem prover designed for users with little or no knowledge of automated theorem proving. The prover is intended for high speed solution of small to moderate sized problems, usually with no user guidance. This contrasts with many provers designed to use …
-
Second Order Logic and Logical Form
… several related issues surrounding second order logic. The central problem running throughout is whether second order logic should provide the underlying logic for formalizations of natural language. A prior problem is determining the significance of this choice. Such controversies over the …
-
Logic and games on automatic structures
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it false. This correspondence is exploited algorithmically to evaluate formulas of first and second-order logic on finite structures. We …
-
Transitive Closure Logic and Multihead Automata with Nested Pebbles
Several extensions of first-order logic are studied in descriptive complexity theory. These extensions include transitive closure logic and deterministic transitive closure logic, which extend first-order logic with transitive closure operators. It is known that deterministic transitive closure …
-
Model theory and probability
… thesis, the author uses a continuous version of first order logic that has been developed recently and that is better suited for applications to metric structures than classical first order logic. The set of truth values in continuous logic is the interval [0,1] instead of the truth values {True, …
-
A Framework for Combining Logical and Probabilistic Models
<p>Integrating the expressive power of first-order logic with the probabilistic reasoning power of Bayesian networks has attracted the interest of many researchers. We review many techniques for integration of first-order logic and Bayesian networks and propose a new framework that exploits the …
-
Pure and applied fixed point logics
Fixed-point logics are logics with an explicit operator for forming fixed points of definable mappings. They are particularly well suited for modelling recursion in logical languages and consequently they have found applications in various areas of theoretical computer science such as database …
-
Guarded logics : algorithms and bisimulation
For many practical applications of logic-based methods there is a requirement to balance expressive power against computational tractability. Both identifying decidable sub-classes of first-order logic, and extending modal logic to larger, but nevertheless efficiently solvable languages has been a …
-
Context Aware Textual Entailment
… method can offer both graph representation and First-Order-Logic representation of the text. This research also extracts a First-Order Logic (FOL) and XML representation of a text or series of texts. The method includes entailment using background knowledge from sources (VerbOcean and WordNet), …
-
An Object-oriented Formal Notation: Executable Specifications in Clay = Una notación formal orientada a objetos : especificaciones ejecutables con Clay
… generation of executable prototypes. Clay has a first-order semantics that gives an interpretation in first-order logic of the main object-oriented constructions: inheritance, defining classes by cases, overloading, dynamic binding and static equality. Furthermore, the use of the concrete syntax …
-
Security information management with frame-based attack presentation and first-order reasoning
Internet has grown by several orders of magnitude in recent years, and this growth has escalated the importance of computer security. Intrusion Detection System (IDS) is used to protect computer networks. However, the overwhelming flow of log data generated by IDS hamper security administrators …
-
Average-case complexity of detecting cliques
… (as Karp suggested in 1976). Our results are the first unconditional lower bounds supporting this hypothesis. For bounded-depth Boolean circuits, our average-case hardness result significantly improves the previous worst-case lower bounds of Q(nk/Poly(d)) for depth-d circuits. In particular, our …
-
Stable theories in functional analysis
Model theory is the logical analysis of mathematical structures. The class of structures considered in model theory includes, among others, all structures from algebra, number theory, and finite-dimensional analysis. A limitation, however, is that this class does not include the families of …
-
Extending the relational model with constraint satisfaction
… model to handle constraints and variables as first class citizens, we are able to express first order logic SAT problems using an extended SQL which we refer to as SAT/SQL. With SAT/SQL, one can efficiently solve a wide range of practical constraint and optimization problems. SAT/SQL …
-
Model theory of partially random structures
… random modulo some obvious obstructions. In the first part of this thesis, we document several such situations, show that the randomness in these interactions can be captured using first-order logic, and deduce in consequence many model-theoretic properties of the corresponding structures. The …
-
Gödel's incompleteness theorem
… gives a rigorous development of sentential logic and first-order logic as mathematical models of humanity's deductive thought processes. Important properties of each of these models are stated and proved including Compactness results (the ability to prove a statement from a finite set of …
-
Definable families of finite Vapnik Chervonenkis dimension
… are discussed, and classified according to their first order properties. While maximum classes can be characterized in first-order logic, maximal classes can not
Page 1 of 4