1544 search results - page 205 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
157
click to vote
LPNMR
2009
Springer
16 years 28 days ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
195
click to vote
CN
2007
15 years 6 months ago
2007
Although conceived for web services, it is shown how BPEL (Business Process Execution Language) can be used to orchestrate a collection of grid services. This is achieved using th...
154
click to vote
ICLP
1992
Springer
15 years 10 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
146
click to vote
HICSS
2009
IEEE
16 years 1 months ago
2009
IEEE
As semantic web technologies are increasingly used to empower knowledge management systems (KMSs), there is a growing need for mechanisms and automated tools for checking content ...
172
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...