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 238 for “"First Order Logic"”.
-
Extending relAPS to first order logic
… only Horn-formulas. To extend the system to first order logic, we have defined and implemented a new language based on theory of allegories as well as a new calculus. The language has two different kinds of terms; object terms and relational terms, where object terms are built from object …
-
Semantic Compression of Knowledge Bases via Efficient Top-down Mining of First-order Logic Rules
… tackles the challenge by employing generic first-order Horn rules, which are more expressive than existing techniques, to comprehensively cover KBs under the relational data model. This thesis also proposes optimization techniques from the perspectives of algorithms and data to improve …
-
Enhancing fact-checking in large language models: Cost-effective claim verification through first-order logic reformulation
… effectiveness. By converting complex claims into first-order logic (FOL) and then back into natural language, we observe improved performance in some LLMs, particularly with more challenging dataset subsets. This method, although utilizing GPT-4 for the FOL breakdown, serves as a practical …
-
Proof Editor for Natural Deduction in First-order Logic The Evaluation of an Educational Aiding Tool for Students Learning Logic
… editor for writing natural deduction proofs in first-order logic. The intent is for the editor to serve as a supplementary tool alongside a course in logic. For this reason, emphasis was put on making sure the editor would have a low learning curve, ensuring that learning to use it would not …
-
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 …
-
A formalization of logic in diagonal-free cylindric algebras
… We also offer a complete proof that full first-order logic can be formalized in the calculus of binary relations (a result due to Maddux and Tarski). Finally, we use these constructions to recursively define a translation function from the sentences of first-order logic to the equational …
-
Forward looking logics and automata
… between one-way and two-way temporal logics, minimization of automata, and the ability to effectively characterize logics. We investigate whether these properties can be extended to tree languages or word languages over an infinite alphabet.</p> <p>It is known that linear temporal …
-
Dynamic set reasoning: Specifying and optimizing monitor encodings
… sets on real-time embedded systems requires a logic that offers sufficient expressiveness and acceptable worst-case performance. If a system designer chooses to use a non-first-order logic, they sacrifice expressiveness; if they choose a first-order logic, they sacrifice performance. To …
-
Deductive formal verification of embedded systems
… semantics of a program to a formula in first order logic over multiple underlying theories. We import the semantics of the API invocations as first order logic assertions. These assertions constitute the models used by the analyzer. Logical specification of the desired program behavior …
-
An exact algorithm for first order probabilistic logic
… reason from uncertain data or knowledge in order to reach a conclusion. Several approaches have been proposed in this respect to deal with various kinds of uncertainty in AI. Among these approaches, probabilistic theory is used in many research areas such as knowledge-based systems, data …
-
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, …
-
Extending a first order predicate calculus with partially defined iota terms
We extend the classical first order logic with partially defined iota terms in order to model the way partial functions are treated in common mathematical practice.
-
A Framework for Combining Logical and Probabilistic Models
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 …
Page 1 of 12