149 search results - page 28 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
70
Voted
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
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...
120
click to vote
CI
2000
14 years 10 months ago
2000
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...
90
Voted
ICLP
1997
Springer
15 years 2 months ago
1997
Springer
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...
ECSQARU
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
78
Voted
DEXAW
1998
IEEE
15 years 2 months ago
1998
IEEE
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, ...