725 search results - page 51 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
115
Voted
ER
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
120
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
101
Voted
ICTAC
2007
Springer
15 years 8 months ago
2007
Springer
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
131
Voted
PPDP
1999
Springer
15 years 6 months ago
1999
Springer
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...
228
click to vote
PADL
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...