725 search results - page 35 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
122
Voted
JAIR
2006
15 years 2 months ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
131
Voted
KI
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
135
click to vote
DALT
2003
Springer
15 years 7 months ago
2003
Springer
Work on agent communication languages has since long striven to achieve adequate speech act semantics; partly, the problem is that references to an agent’s architecture (in parti...
120
click to vote
VLDB
1987
ACM
15 years 6 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
148
click to vote
AMAI
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...