4737 search results - page 95 / 948 » The LOGIC negotiation model |
135
click to vote
FSTTCS
2000
Springer
15 years 7 months ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
130
click to vote
AAAI
1990
15 years 4 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
124
Voted
AAAI
2000
15 years 4 months ago
2000
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
138
click to vote
CIE
2005
Springer
15 years 9 months ago
2005
Springer
We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while...
114
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...