4513 search results - page 281 / 903 » Logic programming with satisfiability |
136
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
171
click to vote
JAPLL
2007
15 years 4 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
141
click to vote
DLOG
2008
15 years 6 months ago
2008
The use of Description Logic as the basis for Semantic Web Languages has led to new requirements with respect to scalable and nonstandard reasoning. In this paper, we address the p...
125
click to vote
DLOG
2008
15 years 6 months ago
2008
Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with t...
147
click to vote
JAR
2000
15 years 4 months ago
2000
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...