Sciweavers

1036 search results - page 79 / 208
» Incompleteness of Behavioral Logics
Sort
View
AGP
1994
IEEE
14 years 28 days ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
ESWS
2006
Springer
14 years 14 days ago
Rules with Contextually Scoped Negation
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
Axel Polleres, Cristina Feier, Andreas Harth
IJCAI
2003
13 years 10 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
LPNMR
2009
Springer
14 years 3 months ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
DALT
2006
Springer
14 years 14 days ago
A Dynamic Logic Programming Based System for Agents with Declarative Goals
Goals are used to define the behavior of (pro-active) agents. It is our view that the goals of an agent can be seen as a knowledge base of the situations that it wants to achieve. ...
Vivek Nigam, João Leite