Sciweavers

57 search results - page 4 / 12
» A Mechanized Translation from Higher-Order Logic to Set Theo...
Sort
View
ICFP
2012
ACM
13 years 4 days ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
AI
2004
Springer
14 years 9 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
IJCAI
1997
14 years 11 months ago
Compiling Reasoning with and about Preferences into Default Logic
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
James P. Delgrande, Torsten Schaub
ESWS
2005
Springer
15 years 3 months ago
Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
Patryk Burek, Rafal Grabos
ASYNC
2001
IEEE
164views Hardware» more  ASYNC 2001»
15 years 1 months ago
Synthesis and Implementation of a Signal-Type Asynchronous Data Communication Mechanism
This paper describes the synthesis and hardware implementation of a signal-type asynchronous data communication mechanism (ACM). Such an ACM can be used in systems where a data-dr...
Alexandre Yakovlev, Fei Xia, Delong Shang