Sciweavers

367 search results - page 51 / 74
» Temporal Reasoning for Procedural Programs
Sort
View
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 8 months ago
Domain-Dependent Knowledge in Answer Set Planning
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila ...
ICFP
2010
ACM
13 years 9 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
POPL
2011
ACM
12 years 11 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
ICLP
2005
Springer
14 years 2 months ago
OWL: A Description Logic Based Ontology Language
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
Ian Horrocks
ICLP
2005
Springer
14 years 2 months ago
Small Proof Witnesses for LF
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
Susmit Sarkar, Brigitte Pientka, Karl Crary