http:^^www.cs.engr.uky.edu^~lpnmr^kent_lpnmr.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 72 行

Date: Tuesday, 26-Nov-96 00:54:05 GMT
Server: NCSA/1.3
MIME-version: 1.0
Content-type: text/html

<TITLE>Logic Programming and Nonmonotonic Reasoning at Kentucky</TITLE>

<H1>LPNMR AT KENTUCKY</H1>

<!WA0><A HREF="http://www.cs.engr.uky.edu/~lpnmr">Logic 
programming and nonmonotonic reasoning </A> (LPNMR) is an active research
area in the <!WA1><A HREF="http://www.cs.engr.uky.edu"> Computer Science Department 
</A> at the <!WA2><A HREF="http://www.uky.edu/"> University of Kentucky. </A>
The research group consists of three faculty of the Department:

<UL>
<LI> <B> <!WA3><A HREF="http://www.cs.engr.uky.edu/~marek"> V. Wiktor Marek </A> 
<LI> <B> <!WA4><A HREF="http://www.cs.engr.uky.edu/~mirek"> Mirek Truszczynski </A> 
<LI> <B> <!WA5><A HREF="http://www.cs.engr.uky.edu/~sekar"> Arcot Rajasekar </A> 
</UL>

These researchers work with a group of students including 
<!WA6><A HREF="http://www.cs.engr.uky.edu/~pawel"> Pawel Cholewinski <A/>,
<!WA7><A HREF="http://www.cs.engr.uky.edu/~artur"> Artur Mikitiuk </A>, <!WA8><A HREF="http://al.cs.engr.uky.edu/~oldham"> Joseph Oldham </A>,  
and Bill Brooks. Main research topics are:

<UL>
<LI> <B> DERES - a Default Reasoning System
<LI> <B> TheoryBase - a workbench for experimenting with LPNMR
<LI> <B> Complexity and expressibility of LPNMR
<LI> <B> Revision programming
<LI> <B> Default Logic
<LI> <B> Disjunctive Logic Programming
<LI> <B> String Logic
</UL>

<H2>ON-LINE PAPERS</H2>

<UL>
<LI> <B> <!WA9><A
HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/rev-prog.ps">
Revision programming </A>

<LI> <B> <!WA10><A
HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/approx-stable.ps">
Approximating the stable model semantics is hard </A>

<LI> <B> <!WA11><A HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/icdt-95.ps">
Revision programming, database updates and integrity constraints </A>

<LI> <B> <!WA12><A
HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/jelia-94.ps">
Revision specifications by means of programs </A>

<LI> <B>
<!WA13><A HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/ijcai-95.ps">
Constrained and rational default logics </A>

<LI> <B>
<!WA14><A HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/iclp-95.ps">
Experimenting with Nonmonotonic Reasoning </A>

<LI> <B>
<!WA15><A HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/lpnmr-95.ps">
Skeptical rational extensions </A>

<LI> <B>
<!WA16><A HREF="ftp://al.cs.engr.uky.edu/cs/manuscripts/s4-s4f.ps">
Nonmonotonic reasoning is sometimes simpler</A>

</UL>