838 search results - page 42 / 168 » From Natural Language to Formal Proof Goal |
268
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
157
click to vote
ICAIL
2007
ACM
15 years 10 months ago
2007
ACM
One of the main obstacles to progress in the field of artificial intelligence and law is the natural language barrier, but the technology of natural language processing has advanc...
202
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...
186
Voted
COOPIS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
196
click to vote
ICFP
2012
ACM
13 years 8 months ago
2012
ACM
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...