Ringvorlesung: Gerhard Lakemeyer: Tractable Reasoning in First-Order Knowledge Bases

Dienstag, 05.07.2022, 16.30 Uhr

 

Vortragender: Gerhard Lakemeyer

 

 

Abstract::

In knowledge representation, obtaining a notion of belief which is tractable, expressive, and eventually complete has been a somewhat elusive goal. Expressivity here means that an agent should be able to hold arbitrary beliefs in a very expressive language like that of first-order logic, but without being required to perform full logical reasoning on those beliefs. Eventual completeness means that any logical consequence of what is believed will eventually come to be believed, given enough reasoning effort.

Tractability in a first-order setting has been a research topic for many years, but in most cases limitations were needed on the form of what was believed, and eventual completeness was so far restricted to the propositional case. In this talk I present a novel logic of limited belief, which has all three desired properties.

Ort: Department of Computer Science, Ahornstr. 55, building E2 (no. 2356), ground floor, room: B-IT 5053.2. 
We are looking forward to meeting you in person!
Nevertheless, all events are hybrid. To join remotely, please use:
https://rwth.zoom.us/j/96003885007?pwd=aUczMVdVU0ZXVGtQUFpwQnJHQUFhUT09
Meeting ID: 960 0388 5007, Passcode: 273710