Connectives in first-order logic sentences, Computer Engineering

Assignment Help:

Connectives in first-order logic sentences - Artificial intelligence

We may string predicates together into a sentence in the same way by utilising connectives that we did for propositional logic. We call a set of predicates strung together in the definite way a sentence. Notice that a particular predicate may be thought of as a sentence.

There are 5 connectives in first order logic. Firstly, we have "and", which we write ∧, and "or", which we write ∨. In the obvious ways these connect predicates together. So that if we wanted to say that "Simon lectures Artificial Intelligence and Simon lectures bioinformatics", we could write down:

lectures_ai(simon) ∧ lectures_bioinformatics(simon)

Notice also that now we are talking regarding different lectures, it must be a good idea to change our option of predicates, and make ai and bioinformatics constants:

lectures(simon, ai) ∧ lectures(simon, bioinformatics)

The other connectives existing to us in first-order logic are (a) "not", written that negates the truth of a predicate (b) "implies", written which may be used to say that 1 sentence being true follows from another sentence being true, and (c) "if and only if" (also known as "equivalence"), written ->, which may be used to state that the truth of 1 sentence is always the same as the truth of another sentence.

For example, if we want to say that "if Simon isn't lecturing Artificial Intelligence, then Bob might be lecturing AI", we could write it thus:

 ¬ lectures(simon, ai) -> lectures(bob, ai)

The things that predicates regard are terms: these may be variables, constants or the output from functions.


Related Discussions:- Connectives in first-order logic sentences

Why is xml such an important development, It takes away two constraints whi...

It takes away two constraints which were holding back Web developments: 1. Dependence on a one, inflexible document type (HTML) which was being much abused for tasks it was neve

Recursion, Ask qurecurrion for short noteestion

Ask qurecurrion for short noteestion

Multi-threaded processors, Multi-Threaded Processors In unit 2, we have...

Multi-Threaded Processors In unit 2, we have gone through the use of distributed shared memory in parallel computer architecture. Although the use of distributed shared memory

Basic need of search engines, Q. Basic need of Search Engines? Search E...

Q. Basic need of Search Engines? Search Engines are programs which search the web. Web is a big graph with pages being the nodes and hyperlinks being the arcs. Search engines c

Determine about the verilog task, Determine about the Verilog Task - Ta...

Determine about the Verilog Task - Tasks are capable of enabling a function as well as enabling other versions of a Task. - Tasks also run with a zero simulation however the

Joint application development session leader, Q.Joint Application Developme...

Q.Joint Application Development session leader? JAD session leader: JAD leader organizes and runs the JAD. This person is trained in group management and facilitation as well

Illustration of an instruction cycle, Q. Illustration of an instruction cyc...

Q. Illustration of an instruction cycle? Instruction cycle displayed in given figure comprises subsequent stages: First address of the subsequent instruction is calculat

Two properties of recursion, Two properties of recursion are:- 1. A sm...

Two properties of recursion are:- 1. A smallest, base case that is processed without recursion and acts as decision criterion for stopping the method of computation and 2.

Representation scheme in artificial intelligence, Representation scheme in ...

Representation scheme in artificial intelligence: It is not hard to see why logic has been popular representation scheme in AI: In this way, It is easy to represent knowl

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd