Sciweavers

1143 search results - page 95 / 229
» Abstract Syntax and Logic Programming
Sort
View
119
Voted
LPNMR
2005
Springer
15 years 8 months ago
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
Lengning Liu, Miroslaw Truszczynski
131
Voted
PPDP
2004
Springer
15 years 7 months ago
Nominal rewriting systems
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
Maribel Fernández, Murdoch Gabbay, Ian Mack...
135
Voted
LPNMR
2004
Springer
15 years 7 months ago
Using Criticalities as a Heuristic for Answer Set Programming
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
Orkunt Sabuncu, Ferda Nur Alpaslan, Varol Akman
124
Voted
FASE
2008
Springer
15 years 4 months ago
An Algebraic Semantics for MOF
Abstract. Model-driven development is a field within software engineering in which software artifacts are represented as models in order to improve productivity, quality, and cost ...
Artur Boronat, José Meseguer
STACS
2009
Springer
15 years 9 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson