Sciweavers

1194 search results - page 206 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
AUSAI
2004
Springer
14 years 2 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
PEPM
1999
ACM
14 years 1 months ago
Declarative Aspect-Oriented Programming
Aspect-oriented programming addresses the problem that the implementation of some properties such as error handling and optimization tends to cross-cut the basic functionality. To...
Ralf Lämmel
CAV
1997
Springer
102views Hardware» more  CAV 1997»
14 years 19 days ago
Efficient Model Checking Using Tabled Resolution
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular,...
Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramak...
DBPL
1991
Springer
66views Database» more  DBPL 1991»
14 years 17 days ago
Rationale and Design of BULK
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
Steve Rozen, Dennis Shasha
LOGCOM
2010
128views more  LOGCOM 2010»
13 years 7 months ago
Answer Set Programming with Resources
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
Stefania Costantini, Andrea Formisano