725 search results - page 1 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
ICLP
1992
Springer
13 years 8 months ago
1992
Springer
TCS
2010
13 years 3 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
EPIA
2005
Springer
13 years 10 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
AI
2002
Springer
13 years 4 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...