Search for dissertations about: "first-order logic"

Showing result 11 - 15 of 38 swedish dissertations containing the words first-order logic.

2. 11. Extending the Automated Reasoning Toolbox

   Author : Ann Lillieström; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; First-Order Logic; Sorted Logic; Automated Reasoning;

   Abstract : Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range of problems than the standard ones of satisfiability and derivability. We extend the automated reasoning toolbox by intro- ducing two new tools for analysing problems in first-order logic. Infinox is aimed at showing finite unsatisfiability, i.e. READ MORE

4. 12. Extending the Automated Reasoning Toolbox

   Author : Ann Lillieström; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; transitivity; integer linear programming; first-order logic; many-sorted logic; automated reasoning; morpheme segmentation;

   Abstract : Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range of problems than the standard ones of satisfiability and derivability. We extend the automated reasoning toolbox by introducing three new tools for analysing problems in first-order logic. Infinox aims to show finite unsatisfiability, i.e. READ MORE

5. 13. Mapping and integration of schema representations of component specefications

   Author : Guy Davies; Love Ekenberg; Hamid Fujita; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; specification; first order logic; verification; service integration; conceptual modeling; conflict; shema dynamics; Datavetenskap; Computer science; Datavetenskap;

   Abstract : Specification for process oriented applications tends to use languages that suffer from infinite, intractable or unpredictably irregular state spaces that thwart exhaustive searches by verification heuristics. However, conceptual schemas based on FOL, offer techniques for both integrating and verifying specifications in finite spaces. READ MORE

6. 14. Computational Issues in Calculi of Partial Inductive Definitions

   Author : Per Kreuger; RISE; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Theory of computation; algorithms; logic; proof-theory; partial inductive defi-nitions; definitional reflection; disunification; closure; completion; negation; constructive negation; quantification; logic programming; meta programming; quantification; skolemization; self-reference; program semantics; declarative control; proof-search; theorem-proving.;

   Abstract : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. READ MORE

7. 15. Deductive Planning and Composite Actions in Temporal Action Logic

   Author : Martin Magnusson; Patrick Doherty; John-Jules Meyer; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Temporal Action Logic; deductive planning; composite actions; interval algebra; constraint logic programming; execution monitoring; Computer science; Datalogi;

   Abstract : Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. READ MORE