725 search results - page 38 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
PADL
2001
Springer
15 years 7 months ago
2001
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
153
click to vote
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
144
Voted
JAIR
2010
15 years 29 days ago
2010
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
109
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
139
Voted
LICS
1991
IEEE
15 years 6 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...