4513 search results - page 300 / 903 » Logic programming with satisfiability |
121
click to vote
ASYNC
2002
IEEE
15 years 9 months ago
2002
IEEE
Wire and gate delays are accounted to have equal, or nearly equal, effect on circuit behavior in modern design techniques. This paper introduces a new approach to verify circuits ...
125
click to vote
DLOG
2008
15 years 6 months ago
2008
Abstract. In this paper, we propose a new method for revising terminologies in description logic-based ontologies. Our revision method is a reformulation of the kernel revision ope...
173
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
133
click to vote
ACTA
2004
15 years 4 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
126
click to vote
APAL
1999
15 years 4 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...