Sciweavers

149 search results - page 28 / 30
» Encoding Planning Problems in Nonmonotonic Logic Programs
Sort
View
PPDP
2005
Springer
14 years 27 days ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
CI
2000
114views more  CI 2000»
13 years 7 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ICLP
1997
Springer
13 years 11 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ECSQARU
2007
Springer
14 years 1 months ago
Syntactic Propositional Belief Bases Fusion with Removed Sets
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
Julien Hué, Odile Papini, Eric Würbel
DEXAW
1998
IEEE
155views Database» more  DEXAW 1998»
13 years 11 months ago
Business-Oriented Component-Based Software Development and Evolution
Huge size and high complexity of legacy software are the main sources of today's software evolution problems. While we can ease software evolution with re-engineering tools, ...
Stan Jarzabek, Martin Hitz