• No results found

classical first-order logic

Expressing Disjunctive and Negative Feature Constraints With Classical First Order Logic

Expressing Disjunctive and Negative Feature Constraints With Classical First Order Logic

... Further, first-order logic can be used to axiomatize other types of feature structures in addition to attribute-value structures such as "set-valued" elements and express a wider variety[r] ...

7

On Algebraization of Classical First Order Logic

On Algebraization of Classical First Order Logic

... Polyadic algebra is an extension of Boolean algebra with operators corresponding to the usual existential and universal quantifiers over several variables together with endomorphisms to [r] ...

5

Features and Formulae

Features and Formulae

... "Expressing Disjunctive and Negative Feature Constraints with Classical First-order Logic," in The Proceedings of the 28th Annual Meeting of the Association for Computational Linguistics[r] ...

22

First-Order Logic and Some Existential Sentences

First-Order Logic and Some Existential Sentences

... the classical logician need not and does not hold that ‘some’ in English always has existential ...The classical logician need not, and typically does not, suppose that the word ‘and’ always so ...the ...

16

Tools and techniques for machine assisted meta theory

Tools and techniques for machine assisted meta theory

... In order to represent first order theories in a manner suitable for meta-theoretic reasoning, we must consider the proof process and its resulting ...as first order intuitionistic ...

182

PP 2009 40: 
  First Order Logic Formalisation of Arrow's Theorem

PP 2009 40: First Order Logic Formalisation of Arrow's Theorem

... explore to what extent it is possible to model the framework underlying Arrow’s Theorem in classical FOL. There are two reasons for focusing on FOL: it is a natural language for speaking about linear orders, which ...

14

Relevant First-Order Logic LP# and Curry’s Paradox Resolution

Relevant First-Order Logic LP# and Curry’s Paradox Resolution

... This is a problem. Our true entails an arbitrary . This inference arises independently of any treatment of negation. The form of the inference is reasonably well known. It is Curry’s paradox, and it causes a great deal ...

7

Logic Programs vs  First Order Formulas in Textual Inference

Logic Programs vs First Order Formulas in Textual Inference

... The first-order reasoning problems that can be naturally expressed by logic programs have a distinctive syntactic feature: they belong to the “effectively propositional,” or “near-propositional” ...

6

On the relationship between hypersequent calculi and labelled sequent calculi for intermediate logics with geometric Kripke semantics

On the relationship between hypersequent calculi and labelled sequent calculi for intermediate logics with geometric Kripke semantics

... Gabbay [Gab96] presents a general theory of relational proof systems, called labelled deductive systems (or LDS, for short). Of note, he introduces a method of deriving a relational semantics for an arbitrary ...

333

Knowledge based recommender system using First 
		Order Logic for Indian 
		classical music

Knowledge based recommender system using First Order Logic for Indian classical music

... Indian classical music, a raga is a series of swaras (musical notes) in a particular ...Indian classical music follow the practice of transitioning from one raga to another while ...Indian classical ...

19

The Triguarded Fragment of First-Order Logic

The Triguarded Fragment of First-Order Logic

... different logic, which is effectively equivalent to TGF , but which makes presentation significantly ...our logic provided a “built-in” binary predicate whose extension always contains all pairs of domain ...

16

Question Answering over Linked Data Using First order Logic

Question Answering over Linked Data Using First order Logic

... by first converting natural language utterances into meaningful representations ...limited logic form with the semantic item query, which we believe is more appropriate for answering factoid ...

12

DLS-Forgetter: An Implementation of the DLS Forgetting Calculus for First-Order Logic

DLS-Forgetter: An Implementation of the DLS Forgetting Calculus for First-Order Logic

... Finally, as mentioned earlier, the output is a forgetting solution if it does not contain any of the predicate symbols specified in the forgetting signature. We say that forgetting has succeeded. Otherwise, the output is ...

12

A Complete Cyclic Proof System for Inductive Entailments in First Order Logic

A Complete Cyclic Proof System for Inductive Entailments in First Order Logic

... For this reason, the developments in this section are inspired by a state-of-the-art language inclusion algorithm for top-down tree automata [9], briefly explained next. Our method for developing a proof system (set of ...

19

Second order logic is logic

Second order logic is logic

... If "follows from" is taken too narrowly (and arguably how Frege meant it to be taken) then we confront another notion, again traditionally associated with logic: that of effectiveness. A formal system is ...

226

Chinese Named Entity Abbreviation Generation Using First Order Logic

Chinese Named Entity Abbreviation Generation Using First Order Logic

... search engine results. For each entity whose abbreviation cannot be identified thorough the regular expressions described above, we combine entity and “简 称 (abbreviation)” as queries for retrieving. The first ...

9

PP 2016 26: 
  On a New Semantics for First Order Predicate Logic

PP 2016 26: On a New Semantics for First Order Predicate Logic

... formulas first modulo validity to improve performance of the translation, or reducing to generalized quantifier results like those for the generalized semantics of Anapolitanos & Väänänen ...

9

The Sorites x Classical Logic

The Sorites x Classical Logic

... the first three steps in The Sorites, and asks you if taking one grain made a ...the first 2,000 steps, and ask the same question when your initial heap had 3,000 grains of sand, and they were about the ...

7

Proof theoretic investigations into integrated logical and functional programming

Proof theoretic investigations into integrated logical and functional programming

... integrating logic and func­ tional programming. This language extends ideas first presented in [Pin94, ...integrating logic and functional programming, such as ALF [Han90], Babel [MNRA92], Curry ...

187

Wires, P=NP in Applied Logic

Wires, P=NP in Applied Logic

... Keywords – First order logic, logic gates, Turing machine, Foundation of computer architecture, using logic gates to program, networks of wires to replace transistors.[r] ...

7

Show all 10000 documents...

Related subjects