Sciweavers

175 search results - page 16 / 35
» Implementing Ordered Choice Logic Programming using Answer S...
Sort
View
94
Voted
ICLP
2010
Springer
15 years 1 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
102
Voted
DLOG
2003
14 years 11 months ago
Incremental Query Answering for Implementing Document Retrieval Services
Agent systems that search the Semantic Web are seen as killer applications for description logic (DL) inference engines. The guiding examples for the Semantic Web involve informat...
Volker Haarslev, Ralf Möller
PLDI
2003
ACM
15 years 2 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
AGP
2003
IEEE
15 years 2 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
15 years 9 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler