in GG oteborg (where it was nished) for their supportive environments. We are especially thankful to Grigori Mints for proposing the subject for research and clarifying numerous questions. G. Mints has also helped with numerous suggestions and corrections concerning the earlier versions of the paper. P.Lincoln and J.Smith have helped with various suggestions and corrections regarding the previo...

Although we concur with many of Nils’s other assertions, this propositional doctrine seems far too extreme: a lot of interesting and important AI research is done outside of the logic-and-theorem-proving paradigm.’ Indeed, the view that other lines of inquiry serve only to produce tools that may be procedurally attached to an AI (logic-and-theorem-proving) architecture seems a kind of Logic Imp...

Logic programming can be given a foundation in sequent calculus, viewing computation as the process of building a cut-free sequent proof from the bottom-up. Earliest accounts of logic programming were based in classical logic and then later in intuitionistic logic. The use of linear logic to design new logic programming languages was inevitable given that it allows for more dynamics in the way ...

In this paper we start the design of a functional-logic deductive database language. Given that most logic deductive languages consider bottom-up evaluation as operational mechanism, here we will focus on the development of an operational semantics based on bottomup evaluation for functional logic languages. As in the logic paradigm, the bottom-up evaluation will consist in a magic transformati...

New trends and the effect of key factors influence the quality of the holes produced by ECM processes. Researchers developed a fuzzy logic controller by adding intelligence to the ECM process. Maintaining optimum ECM process conditions ensures higher machining efficiency and performance. This paper presents the development of a fuzzy logic controller to add intelligence to the ECM process. An e...

We introduce probabilistic regular tree expressions and give a Kleene-like theorem for probabilistic tree automata (PTA). Furthermore, we define probabilistic MSO logic. This logic is more expressive than PTA. We define bottom-up PTA, which are strictly more expressive than PTA. Using bottom-up PTA, we prove a Büchi-like theorem for probabilistic MSO logic. We obtain a Nivat-style theorem as an...

Given a logic program that is terminating and mode-correct in an idealized Prolog interpreter (i.e., in a top-down logic programming engine), a bottom-up logic programming engine can be used to compute exactly the same set of answers as the top-down engine for a given mode-correct query by rewriting the program and the query using the Magic Sets Transformation (MST). In previous work, we have s...

this paper will examine ibn sina’s theory of the conditional syllogism from a purely logical point of view, and will lay bare the principles he adopted for founding his theory, and the reason why the newly introduced part of his logic remained undeveloped and eventually was removed from the texts of logic in the later islamic tradition. as a preliminary discussion, this paper briefly examines i...