Sciweavers

1963 search results - page 197 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
HASE
2008
IEEE
15 years 10 months ago
Localizing Program Errors via Slicing and Reasoning
Model-based program debugging exploits discrepancies between the program behavior anticipated by a programmer and the program’s actual behavior when executed on a set of inputs....
Fei Pu, Yan Zhang
158
Voted
AGENTS
2000
Springer
15 years 8 months ago
Tools for Developing and Monitoring Agents in Distributed Multi-Agent Systems
Before the powerful agent programming paradigm can be adopted in commercial or industrial settings, a complete environment, similar to that for other programming languages, must b...
John R. Graham, Daniel McHugh, Michael Mersic, Fos...
DAC
2004
ACM
16 years 4 months ago
Abstraction of assembler programs for symbolic worst case execution time analysis
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...
Klaus Schneider, Tobias Schüle
115
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 3 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
COLING
2002
15 years 3 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...